Pagini recente » Cod sursa (job #651049) | Cod sursa (job #2764998) | Cod sursa (job #1029029) | Cod sursa (job #37028) | Cod sursa (job #2332028)
#include <fstream>
using namespace std;
ifstream f("zero2.in");
ofstream g("zero2.out");
int factorial(int number)
{
int result=1;
for(int i=1; i<=number; i++)
result=result*i;
return result;
}
long long int conversion(int number, int base)
{
int digitsArray[100000]={0}, count=0;
while(number)
{
digitsArray[count]=digitsArray[count]*10+number%base;
count++;
number=number/base;
}
long long int result=0;
for(int i=count-1; i>=0; i--)
result=result*10+digitsArray[i];
return result;
}
int main()
{
int n, base;
while(f>>n>>base)
{
long long int number=1, count=0;
for(int i=1; i<=n; i++)
number=number*factorial(i);
long long int result=conversion(number, base);
while(result%10==0)
{
count++;
result=result/10;
}
g<<count<<"\n";
}
return 0;
}