Cod sursa(job #2671912)
Utilizator | Data | 12 noiembrie 2020 20:12:44 | |
---|---|---|---|
Problema | Factorial | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n = 1,p1,p;
int main()
{
f>>p1;
while(p < p1)
{
int nr5 = 0 ,copien = n;
while(copien%5 == 0)
{
copien/=5;
nr5++;
}
p += nr5;
if(p1 != p)
n++;
}
g<<n;
return 0;
}