Cod sursa(job #2542802)
Utilizator | Nita Iulian baTTLe4u_15 | Data | 10 februarie 2020 16:45:05 |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int nZero(int n)
{
int nr=0,p=5;
while(p<=n)
{
nr+=n/p;
p*=5;
}
return nr;
}
ifstream f("fact.in");
ofstream g("fact.out");
int p;
int solve(int left, int right, int *final)
{
if(left > right) return 0;
int mid = (left+right)/2;
int rez = nZero(mid);
if(rez >= p) *final=mid, solve(left, mid-1, final);
if(rez < p) solve(mid+1, right, final);
}
int main()
{
f >> p;
int x=-1;
int rez = solve(1, 1000000000, &x);
g << x;
}