Cod sursa(job #649332)
Utilizator | Data | 15 decembrie 2011 19:27:50 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n,i,p,m;
long long a;
int main() {
f>>p;
if (n<0) {
g<<"-1";
return 0;
}
a=1;
n=2;
while (p>0) {
m=n-n/100000*100000;
a=a*m;
a=a-a/1000000*1000000;
while (a%10==0) {
p--;
a=a/10;
if (p==0&&a%10==0) {
g<<"-1";
return 0;
}
}
n++;
if (n%2!=0&&n%5!=0) n++;
}
if ((n-1)%2!=0&&(n-1)%5!=0) n-=2;
else n--;
g<<n;
return 0;
}