Cod sursa(job #2627708)
Utilizator | Data | 12 iunie 2020 00:25:05 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main () {
int n, p;
f >> n;
int nr = 0;
long long mult5 = 5;
while (nr <= n) {
long int pow = 1;
int nr_pow = 1;
while (pow < mult5) {
pow *= mult5;
nr_pow++;
}
if (pow == mult5) {
nr += nr_pow;
} else {
nr++;
}
mult5 += 5;
}
g << mult5;
return 0;
}