Cod sursa(job #838810)
Utilizator | Data | 20 decembrie 2012 16:46:59 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
int n,p;
int k=1;
long long z=1;
int main()
{
f>>p;
if(p==0)
{
g<<"1";
return 0;
}
k=pow(10,p);
do
{for(int i=1;i<=n;++i)
z*=i;
if(z%k!=0)
{
n++;
}
}while(z%k!=0);
g<<n;
g.close();
return 0;
}