Cod sursa(job #502536)
Utilizator | Data | 19 noiembrie 2010 22:34:42 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int main()
{
long n,k=1,p=0;
ifstream f ("fact.in");
ofstream g ("fact.out");
f>>n;
int i=1;
while (p<n)
{
k=i*k;
while (k%10==0)
{
p++;
k=k/10;
}
k=k%100;
i++;
}
if (p==n)
g<<--i;
else
g<<-1;
f.close();
g.close();
return 0;
}