Cod sursa(job #1036863)
Utilizator | Data | 19 noiembrie 2013 17:56:11 | |
---|---|---|---|
Problema | Factorial | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[10000005];
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
int p,m=0,k=0,s=0;
f >> p;
for(int i=0;i<=10000000;i++)
{
a[i+1]=a[i]+5;
}
for(int i=1;i<=10000000;++i)
{
m=0;
k=a[i];
while(a[i]%5==0)
{
a[i]=a[i]/5;
++m;
}
s=s+m;
if(s==p)
{
break;
}
}
g << k;
return 0;
}