Pagini recente » Cod sursa (job #1518853) | Cod sursa (job #1328114) | Cod sursa (job #2263617) | Cod sursa (job #2279362) | Cod sursa (job #702520)
Cod sursa(job #702520)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
int z[100005], p;
//int zerouri(int n) {
// int rez=0, k=n;
// while(k%5==0) { k/=5; rez++; }
//
// if(n==1) { return 0; }
// return (rez+zerouri(n-1));
//}
int main() {
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
cout<<p<<"\n";
//int start, stop, mij, i;
//start=1; stop=INT_MAX-1;
int i=1, k,rez;
z[1]=0;
while(z[i]<p) {
i++;
k=i; rez=0;
while(k%5==0) { k/=5; rez++; }
z[i]=z[i-1]+rez;
}
k=i;
if(z[i]==p) g<<i;
else g<<"-1";
f.close();
g.close();
return 0;
}