Cod sursa(job #2068049)
Utilizator | Data | 17 noiembrie 2017 09:38:47 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
// shiftat 1<<l ( 2^l )
int main()
{
int p, i, ajt, ci, cinci;
f >> p;
ajt = i = 1;
cinci = 0;
if ( p >= 1000) {
while ( p >= 1000 ) {
p -= 1000;
i += 4005;
}
}
while ( p > 0 ) {
ci = i;
while ( ci % 5 == 0 ) {
cinci++;
ci /= 5;
p--;
}
i++;
}
g << i-1;
f.close();
g.close();
return 0;
}