Cod sursa(job #2926310)
Utilizator | Data | 17 octombrie 2022 17:45:31 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
#include <cmath>
int sf(int n){
int i = 1;
int s = 0;
while(floor(n/pow(5,i))){
s += floor(n/pow(5,i));
i++;
}
return s;
}
int main(){
int p, n = 0;
f >> p;
while(sf(n) != p) n++;
g << n;
f.close();
g.close();
return 0;
}