Pagini recente » Cod sursa (job #2404964) | Cod sursa (job #1024030) | Cod sursa (job #2354258) | Cod sursa (job #2194941) | Cod sursa (job #2404968)
#include <iostream>
#include <fstream>
#define L 28
using namespace std;
int p;
int nr0(int n){
int r=0;
while(n>=5){
r+=n/5;
n/=5;
}
return r;
}
int caut(){
int n=0;
int pas=1<<L;
while(pas!=0){
if(nr0(n+pas) < p){
n+=pas;
}
pas/=2;
}
if(nr0(n)==p)
return n + 1;
return -1;
}
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
fin>>p;
fout<<caut();
return 0;
}