Cod sursa(job #2404964)
Utilizator | Data | 13 aprilie 2019 17:18:39 | |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#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;
}
return n + 1;
}
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
fin>>p;
fout<<caut();
return 0;
}