Cod sursa(job #3219301)
Utilizator | Data | 30 martie 2024 17:52:39 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("factorial.in");
ofstream out("factorial.out");
int main() {
long long int p, z=0;
in>>p;
if (p==0) {
out<<1;
return 0;
}
for (int n=0; ; n+=5) {
z = 0;
for (int i=5; i<=n; i*=5) z+=n/i;
if (z == p) {
out<<n;
return 0;
}
}
}