Discussion @ 2102. Michael and Cryptography @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

back to thread

Discussion of Problem 2102. Michael and Cryptography

Reply to message

Messages should be written in English and correspond to the matter of the website.
Messages should not contain offences and obscene words.
Messages should not contain correct solutions.

Re: WA#54

Posted by Mahilewets 18 Apr 2017 10:59

Very stupid algo that in a single loop from i=2 to 2*10^6 checks whether i|N works
Because of if we take any combination Factor[20] of primes where at least one Factor[j]>2*10^6 than product of Factor[j] larger than 10^18.