Cod sursa(job #1070159)
Utilizator | Data | 31 decembrie 2013 09:53:02 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long a[100],n,i,j;
int main()
{
f>>n;
a[1]=5;
for(i=2;i<=10;i++)
a[i]=a[i-1]*5;
for(i=1;i<=10;i++)
for(j=a[i];j<=n;j+=a[i])
n-=i;
g<<n*5;
return 0;
}