Factorial Problem in Base K 质因数分解，然后求阶乘的质因数个数

Description

How many zeros are there in the end of s! if both s and s! are written in base k which is not necessarily to be 10? For general base, the digit order is 0-9,A-Z,a-z(increasingly), for example F4 in base 46 is actually 694 in base 10,and f4 in base 46 is 1890 in base 10.

Input

There are multiple cases(less than 10000). Each case is a line containing two integers s and k(0 ≤ s < 2^63, 2 ≤ k ≤ 62).

Output

For each case, output a single line containing exactly one integer in base 10 indicating the number of zeros in the end of s!.

Sample Input

101 2
12 7

Sample Output

3
1
***********************************************************************************************************************************************************
加个链接，很详细（阶乘的质因数求法）http://blog.csdn.net/hackbuteer1/article/details/6690015
***********************************************************************************************************************************************************

#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
using namespace std;
#define inf  0x7fffffff
long long  a[1001],b[1001],ge;
void init(long long kk)//对k进行质因数分解
{
    long long  k=kk,it,jt;
    ge=0;
    for(it=2;it<=kk;it++)
    {
        if(k%it==0&&k>0)
        {
            ge++;
            jt=0;
            a[ge]=it;
            while(k%it==0)
            {
                jt++;
                k/=it;
            }
            b[ge]=jt;
        }
    }
}
int main()
{
    char str1[1001];
    long long n,k,i,j;
    while(scanf("%s %lld",str1,&k)!=EOF)
    {
        init(k);
        long long len=strlen(str1);
        //cout<<"len:: "<<len<<endl;
        n=0;
        for(i=0;i<len;i++)
        {
            if(str1[i]>='0'&&str1[i]<='9')
              n=n*k+(str1[i]-'0');
            if(str1[i]>='A'&&str1[i]<='Z')
              n=n*k+(str1[i]-'A'+10);
            if(str1[i]>='a'&&str1[i]<='z')
              n=n*k+(str1[i]-'a'+36);
        }
        //cout<<"n:: "<<n<<endl;
        //cout<<"ge:: "<<ge<<endl;
        //for(i=1;i<ge;i++)
        //{
            //printf("a[%lld]: %lld   b[%lld]: %lld
",i,a[i],i,b[i]);
        //}
        long long min=-1,sum,m;
        for(i=1;i<=ge;i++)
        {
            sum=0;
            m=n;
            while(m>0)
            {
                sum+=(m/a[i]);
                m/=a[i];
            }
            if(min==-1)
               min=sum/b[i];
            else
            {
                if(min>(sum/b[i]))
                  min=(sum/b[i]);
            }
        }
        printf("%lld
",min);

    }

}