Segment Sieve

int factorialPrimePower(int n, int p)
{
    int freq = 0;
    int x = n;
    while(x)
    {
        freq += x / p;
        x /= p;
    }
    return freq;
}