UVa 10061 - How many zero's and how many digits ?

#include <cstdio>
#include <cmath>
#include <cstring>

using namespace std;

int prime[2000];
int n, base;

int GetDigit();
int GetZero();

int main()
{
//freopen("input.txt", "r", stdin);
while (~scanf("%d%d", &n, &base))
{
memset(prime, 0, sizeof(prime));
int digit = GetDigit();
int zero = GetZero();
printf("%d %d\n", zero, digit);
}
return 0;
}

int GetDigit()
{
int i;
double sum = 0;
for (i = 1; i <= n; i++)
{
sum += log(i);
}
sum /= log(base);
return floor(sum + 1e-9) + 1;
}

int GetZero()
{
//先分解在base进制下的n.
int i, j, temp, ans = 0;
for (i = 2; i <= n; i++)
{
temp = i;
for (j = 2; j <= base && j <= temp; j++)
{
while (temp % j == 0)
{
prime[j]++;
temp /= j;
}
}
}
//接下来分解base.
while (true)
{
temp = base;
for (i = 2; i <= base; i++)
{
while (temp % i == 0)
{
if (prime[i] == 0)
return ans;
else
{
prime[i]--;
temp /= i;
}
}
}
ans++;
}
}