Cod sursa(job #3301057)
Utilizator | Data | 21 iunie 2025 13:45:53 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
using namespace std;
long long n, p, mij;
int main()
{
cin>>p;
long long st=1, dr=10000000;
while(st<=dr){
mij=(st+dr)/2;
int q=5, s=0;
while(q<=mij){
s+=mij/q;
q*=5;
}
if(s<p)
st=mij+1;
else dr=mij-1;
}
cout<<st;
}