Pagini recente » Cod sursa (job #2809126) | Cod sursa (job #1992308) | Cod sursa (job #890822) | Cod sursa (job #601420) | Cod sursa (job #2449194)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long factorial(int n)
{
int i,p=1;
for(i=1;i<=n;i++)
p=p*i;
return p;
}
long long verif(int n, int x)
{
int nr=0,y=x;
while(n!=0 && y!=0)
{
if(n%10==0) nr++;
n=n/10;
y--;
}
if(nr==x) return 1;
else return 0;
}
int main()
{
int N,P,nr;
cin>>P;
for(long i=1;i<=100000;i++)
{
if(verif(factorial(i),P)==1)
{cout<<factorial(i); break;}
}
}