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.
see i get one interesting thing, that if we generate all numbers which is <16400 or 1e6 into a set S than for higher numbers say 1e50 we have to just check sum of sq. of digits using your method, if its falling into the set or not;
but i think thats too a time consuming job or not?
:(
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #92: Square digit chains
You are viewing a single comment's thread. Return to all comments →
see i get one interesting thing, that if we generate all numbers which is <16400 or 1e6 into a set S than for higher numbers say 1e50 we have to just check sum of sq. of digits using your method, if its falling into the set or not;
but i think thats too a time consuming job or not? :(