Cod sursa(job #2277746)
Utilizator | Lucian Trepteanu LucianT | Data | 6 noiembrie 2018 19:37:11 |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int n;
long long p;
long long countZeros(long long x){
long long res=0;
long long pw5=5;
while(pw5<=x){
res+=x/pw5;
pw5*=5;
}
return res;
}
int main(){
ifstream cin("fact.in");
ofstream cout("fact.out");
cin>>p;
long long sol;
long long step=(1<<30);
for(sol=0;step>0;step>>=1)
if(countZeros(sol+step)<p)
sol+=step;
cout<<sol+1;
return 0;
}