1 2 3 4 5 6 7 8 9 | # brute-force n = int(raw_input()) f = 2 while n > 1: while n % f == 0: n //= f f += 1 print "max prime factor", (f - 1) |
IyBicnV0ZS1mb3JjZQpuID0gaW50KHJhd19pbnB1dCgpKQpmID0gMgp3aGlsZSBuID4gMToKICAgIHdoaWxlICBuICUgZiA9PSAwOgogICAgICAgICBuIC8vPSBmCiAgICBmICs9IDEKICAgCnByaW50ICJtYXggcHJpbWUgZmFjdG9yIiwgKGYgLSAxKQ==
-
upload with new input
-
result: Success time: 0.1s memory: 10848 kB returned value: 0
600851475143
max prime factor 6857
-
result: Success time: 0.09s memory: 10840 kB returned value: 0
600851475143
max prime factor 6857
-
result: Success time: 0.09s memory: 10904 kB returned value: 0
13195
max prime factor 29


