Cod sursa(job #927709)
Utilizator | Data | 25 martie 2013 23:21:44 | |
---|---|---|---|
Problema | Factorial | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int p,n,k;
int putere(int nr)
{
int k=0;
while(nr%5==0)
{
++k;
nr/=5;
}
return k;
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
n=0;
k=0;
do
{
n++;
k=k+putere(n);
}while(k<p);
g<<n;
}