UVa 10392 Factoring Large Numbers

/* coder: ACboy date: 2010-3-5 result: AC description: UVa 10392 Factoring Large Numbers */ #include <iostream> using namespace std; int prime[500010]; int is_prime(int a) { for (int i = 2; i * i < a; i++) { if (a % i == 0) return 0; } return 1; } void findPrime(int &count) { int begin = 2; count = 0; for (int i = 0; i < 50000; i++) { while (!is_prime(begin)) { begin++; } prime[count++] = begin; begin++; } } int main() { long long int input; int count; findPrime(count); #ifndef ONLINE_JUDGE freopen("10392.txt", "r", stdin); #endif while (cin >> input) { if (input == -1) break; for (int i = 0; i < count; i++) { while (input % prime[i] == 0) { cout << " " << prime[i] << endl; input /= prime[i]; } if (input == 1) break; } if (input != 1 && is_prime(input)) { cout << " " << input << endl; } cout << endl; } return 0; }