Cod sursa(job #3181170)
| Utilizator | Data | 6 decembrie 2023 16:42:24 | |
|---|---|---|---|
| Problema | Factorial | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
/*
20 de zerouri
1 - > 2000000000;
*/
int zeros(int x){
int ctr = 0;
while(x != 0){
x = x/5;
ctr += x;
}
return ctr;
}
int search(int p){
if(p == 0)
return 1;
for(int i = 5; i <= INT_MAX; i+=5){
if(zeros(i)== p){
return i;
}
}
return -1;
}
int main()
{
ifstream in("fact.in");
ofstream out("fact.out");
int p;
in >> p;
out << search(p);
return 0;
}