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
Precal using sieve will give TLE. Normal O(root(n)) works. :|
Well if you know how to calculate the number of divisors of a number in sqrt(N) time then this is a easy question I guess
you will get TLE in brute force but optimize it and your code will work
nice one problem
easy problem.. go through divisor count by using prime factorization
Trial division method have been given ac.
you can ac with bruteforce in java :)
week test cases
Used optimized sieve ........... Got accepted ........... I think polard rho is for FACT1 .............