Cod sursa(job #2066443)
Utilizator | Data | 15 noiembrie 2017 00:08:51 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
long long n,k,p,i,a;
f>>p;
k=n=1;
a=pow(10,p);
if(p==2){g<<10;return 0;}
while(k%a!=0)
{
++n;
k=k*n%(a*10);
}
g<<n;
return 0;
}