Cod sursa(job #626535)
Utilizator | Data | 27 octombrie 2011 15:29:39 | |
---|---|---|---|
Problema | Factorial | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
short v[30000001];
int main ()
{
long i,n,s;
ifstream f("fact.in");
ofstream g("fact.out");
f>>n;
f.close();
s=0;
if(n==0)
g<<"1";
else
for(i=5;i>=4;i=i+5) {
s=s+1+v[i/5];
v[i]=1+v[i/5];
if(s==n) {
g<<i;
break;
}
else if(s>n) {
g<<'-1';
break;
}
}
g.close();
return 0;
}