Pagini recente » Cod sursa (job #2308338) | Cod sursa (job #1087884) | Rating Szekeres Szabolcs (Hunter6699) | Cod sursa (job #2859180) | Cod sursa (job #2404954)
#include <iostream>
#include <fstream>
#define L 16
using namespace std;
int p;
int nr0(int n){
int r=0;
while(n>=5){
r+=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;
}
return n + 1;
}
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
fin>>p;
fout<<caut();
return 0;
}