Cod sursa(job #2115241)
Utilizator | Data | 26 ianuarie 2018 15:56:33 | |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int expp(int n, int p)
{
int s = 0, pp = p;
while(n >= pp)
{
s += n / pp;
pp *= p;
}
return s;
}
int cautbin(int X)
{
int p = 1, u = 500000000, N = 0;
while(p <= u)
{
int m = (p + u) / 2;
int zm = expp(m, 5);
if(X <= zm)
{
N = m;
u = m - 1;
}
else
p = m + 1;
}
return N;
}
int main()
{
int P;
f >> P;
g << cautbin(P);
return 0;
}