Cod sursa(job #1854735)
Utilizator | Data | 23 ianuarie 2017 10:46:47 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
long long p,n,i,pas,L=32,r;
int nr5(int n)
{
int nr;
while(n)
{
nr=n/5;
n/=5;
}
return nr;
}
int main()
{
f>>p;
pas=1<<L;
r=0;
while(pas)
{
if(nr5(r+pas)<p) r+=pas;
pas/=2;
}
return 0;
}