Cod sursa(job #653678)
Utilizator | Data | 28 decembrie 2011 17:12:12 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main()
{
unsigned long long p,n,i=1,j,o;
ifstream f("fact.in");ofstream g("fact.out");
cin>>p;
while(i)
{
n=1;o=0;
for(j=1;j<=i;j++)
n*=j;
while(n%10==0)
{
o++;
n/=10;
}
if(o==p)
{
cout<<i;
i=0;
}
else
i++;
}
return 0;
}