OJ Board

My algorithm is as Follows:

Calculate Factorials upto 5000 by Sieve.
Prime Factorize the given m.
Check the maximum occurrence of each primes of m into n! by a function get_power(int m, int n).
Calculate res = #of total occurrence of a prime in n! / #of total occurrence of a prime in m.
Calculate ...

I have tested with all the test cases found here and compare with the result of UVA toolkit. Everything seems okay but I got WA. Please tell me what the wrong with my code ?


#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include ...