Cod sursa(job #3312602)
| Utilizator | Data | 29 septembrie 2025 10:18:18 | |
|---|---|---|---|
| Problema | Factorial | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
int main(){
ifstream f("fact.in");
ofstream g("fact.out");
long long P,N,x,z;
f>>P;
if(P==0){
g<<1;
return 0;
}
for(N=1;N++;){
x=N;
z=0;
while(x>0){
x/=5;
z+=x;
}
if(z==P){
g<<N;
break;
}
if(z>P){
g<<-1;
break;
}
}
f.close();
g.close();
return 0;
}
