Cod sursa(job #278252)
Utilizator | Data | 12 martie 2009 10:40:00 | |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<iostream.h>
#include<math.h>
#include<fstream.h>
long long i,p,n,s,putere;
float r;
ifstream f("fact.in");
ofstream g("fact.out");
main()
{
f>>p;
if(p==0) g<<'1';
else{
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();
}