Pagini recente » Cod sursa (job #93984) | Cod sursa (job #1504579) | Cod sursa (job #1699740) | Cod sursa (job #1902021) | Cod sursa (job #1702790)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("factorial.in");
ofstream out("factorial.out");
int aflare(int x)
{
int put=5,cnt=0;
while(x>=put)
{
cnt+=x/put;
put=put*5;
}
return cnt;
}
int caut(int n)
{
int st=1;
int dr=100000000;
int ans=1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(aflare(mij)<n)
st=mij+1;
else if(aflare(mij)>=n)
dr=mij-1;
if(aflare(mij)==n)
ans=mij;
}
return ans;
}
int main()
{
int p;
cin>>p;
cout<<caut(p);
return 0;
}