Cod sursa(job #2542774)
Utilizator | Nita Iulian baTTLe4u_15 | Data | 10 februarie 2020 16:20:10 |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
#define nZero(n) ((int)n/5+(int)n/25+(int)n/625)
ifstream f("fact.in");
ofstream g("fact.out");
int p;
int solve(int left, int right)
{
if(left >= right)
return -1;
int mid = (left+right)/2;
int rez = nZero(mid);
if(rez == p)
return mid;
if(rez > p)
solve(left, mid-1);
else
solve(mid+1, right);
}
int main()
{
f >> p;
int rez = solve(1, 10000);
while(nZero(rez) == p)
rez--;
g << rez+1;
}