We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Keywords: primes up to , heap, set or dict of seen values, list of prime exponents. For example, 130754415038 should results in 307916385330322622578697205433200 ([4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]) instead of 1602387094135655108133744107956740 ([2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #110: Diophantine reciprocals II
You are viewing a single comment's thread. Return to all comments →
Keywords: primes up to ,
heap,setordictof seen values,listof prime exponents. For example,130754415038should results in307916385330322622578697205433200([4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]) instead of1602387094135655108133744107956740([2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]).