Cod sursa(job #2364995)
Utilizator | Data | 4 martie 2019 11:41:36 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define NMax 1000000
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long m,s,d,i,x;
long long a[NMax];
int main()
{
f>>x;
for(i=1; i<=x*5; i++)
a[i]=i/5;
s=1,d=x*5;
while (s<=d)
{
m=s+(d-s)/2;
if (a[m]<=x)
s=m+1;
else
d=m-1;
}
m=s+(d-s)/2;
m--;
g<<m;
return 0;
}