Cod sursa(job #1316762)
Utilizator | Data | 14 ianuarie 2015 08:26:45 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
int p,n=1 ;
f >> p;
int factorial=1;
int value = 1 ;
int contor = 0 ;
while (n!=0)
{ value = 1;
factorial = factorial * n ;
while (factorial % 10 == 0)
{
contor++;
factorial = factorial / 10 ;
} factorial = factorial % 10 ;
if (contor == p) {g<< n ; break ;}
else n++;
}
return 0;
}