FACT0 - Integer Factorization (15 digits)
This is a problem to test the robustness of your Integer Factorization algorithm.
Given some integers, you need to factor them into product of prime numbers.
The largest integer given in the input file has 15 digits. FACT1 is a harder version of this problem (the numbers are larger).
You may need to use a general factorization algorithm since no special numbers (e.g. Fermat numbers) are considered when designing the input data.
There are several numbers given, each one in a line.
The input ends with a number 0.
The number of test cases is about 10.
For each number, print in a line the factorization of it. See examples below for the output format.
Input: 3111989 13091989 77145199750673 0 Output: 317^1 9817^1 17^2 89^1 509^1 328439^1 234884407^1
finally ac :')
What should be the output for 1?
very poor form of output to be given, costed me many WA's. Finally AC.
For all those getting TLE
Last edit: 2014-09-25 01:01:55
Got TLE because using %I64u... really annoying that it doesn't cause an error, just TLE.
Can anybody point out why am i getting TLE
got accepted with worst time 4.13 sec
@Mayur Shingote First remove the link.