Pagini recente » Cod sursa (job #2001431) | Cod sursa (job #2487948) | Cod sursa (job #391356) | Cod sursa (job #1482968) | Cod sursa (job #133544)
Cod sursa(job #133544)
#include <fstream>
#include <iostream>
#include <math.h>
using namespace std;
long divizori(long &x)
{
long putere=0,cinci=0;
while (cinci*5+1<=x){cinci=cinci*5+1; putere=putere+1;}
x=x-cinci;
//cout<<endl<<"adun ..."<<pow(5,putere);
return (long)ceil(pow(5,putere));
}
int main()
{
long p,n;
ifstream f("fact.in");
f>>p;
f.close();
n=0;
long adun;
while (p>0)
{adun=divizori(p);
//cout<<endl<<"adun="<<adun;
n=n+adun;
}
ofstream g("fact.out");
g<<n;
g.close();
return 0;
}