Cod sursa(job #1061479)
Utilizator | Data | 19 decembrie 2013 20:41:21 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n,i,p,ad,k,a[12];
int main()
{
f>>p;
n=p*5;
a[1]=5;
for(i=2;i<=12;i++)
a[i]=a[i-1]*5;
if (p==0)
n=1;
else
{
for(i=1;i<=12;i++)
n=n-(p/(a[i]+i))*5;
}
g<<n;
return 0;
}