Pagini recente » Cod sursa (job #1260748) | Monitorul de evaluare | Istoria paginii runda/winners31 | Cod sursa (job #1728140) | Cod sursa (job #1121156)
#include <fstream>
using namespace std;
int zerofactorial(int x)
{
int k5, nr;
k5 = 0;
for (int i = 1; i <= x; i++){
nr = i;
while(nr > 0)
if (nr % 5 == 0){
k5 = k5 + 1;
nr = nr / 5;
}
else nr = -1;
}
return k5;
}
int main ()
{
ifstream f("fact.in");
ofstream g("fact.out");
int N = 1, P;
f >> P;
while ( zerofactorial(N) != P){
N++;
}
g << N;
f.close();
g.close();
}