Cod sursa(job #1061458)
Utilizator | Data | 19 decembrie 2013 20:09:31 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n,i,p,ad,k;
int main()
{
f>>p;
k=25;ad=1;n=0;i=0;
while(i<p)
{
i++;
n=n+5;
if ((n%k)==0)
{
i+=ad;
ad+=1;
k*=5;
}
}
g<<n;
return 0;
}