Cod sursa(job #721758)
| Utilizator | Data | 24 martie 2012 08:18:07 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n,nr5=0,i,nr=0,ok;
int smith(int n)
{
int d=2,p;
nr5=0;
while(n>1)
{
p=0;
while(n%d==0)
{
p=p+1;
n=n/d;
}
if(p&&d==5) nr5+=p;
d=d+1;
}
return nr5;
}
int main()
{
long long unsigned p,lol=1;
f>>p;
i=0;
ok=1;
do
{
i++;
g<<smith(i)<<'\n';
if(smith(i)) nr+=smith(i);
}
while(p>nr);
g<<i<<' '<<nr;
f.close();
g.close();
return 0;
}