UVA 10061 How many zero's and how many digits ?

#include <cstdio>
#include <cmath>
const int primes[150]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797};

int maxp(int &sum, int b)
{
	for (int i = 138; i >= 0; i--)
		if (b % primes[i] == 0) {
			while (b % primes[i] == 0) {
				sum++;
				b /= primes[i];
			}
			return primes[i];
		}
	return 0;
}

int main() {
	int k;
	long long num;
	while (scanf("%lld%d", &num, &k) != EOF) {
		double sum_0 = 0;
		for (int i = 2; i <= num; i++)
			sum_0 += log10(i);
		sum_0 /= log10(k);
		int ans = 0,sum = 0;
		int p=maxp(sum,k);
		int tp = p;
		while (num / p > 0) {
			ans += num / p;
			p *= tp;
		}
		printf("%d %d\n",ans / sum, int(sum_0 + 1e-9 + 1));
	}
	return 0;
}