Cod sursa(job #1687082)
| Utilizator | Data | 12 aprilie 2016 17:40:57 | |
|---|---|---|---|
| Problema | Factorial | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.75 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int zero(int x)
{
int p5 = 5;
int d = 0;
while (x/p5 != 0) {
d =d+ (x/p5);
p5=p5*5;
}
return d;
}
int P;
int main()
{
int N=0,P,i=1;
f>>P;
for(i=0; ;i=i+5)
{
if(zero(i)>P)
{
if(P==0)
{N=i+1;break;}
else
{
N=-1;
break;
}
}
if(zero(i)==P)
{
if(P==0)
{N=i+1;break;}
else
{
N=i;
break;
}
}
}
g<<N;
}
