Cod sursa(job #279471)
Utilizator | Data | 12 martie 2009 20:38:23 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.23 kb |
#include<fstream.h>
#include<math.h>
long i, p, n, s;
ifstream f("fact.in");
ofstream g("fact.out");
void main()
{f>>p;
while(s<p)
{for(i=0;s<=p;i++)
s=(s*5)+1;
s=(s-1)/5;
n=n+pow(5,(i-1));
p-=s;
s=0;}
g<<n;
g.close;}