Pagini recente » Cod sursa (job #437657) | Cod sursa (job #1367169) | Cod sursa (job #3137716) | Cod sursa (job #439666) | Cod sursa (job #1316676)
#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)
{
value = value * 10 ;
factorial = factorial / 10 ;
} factorial = factorial % 10 ;
while(value !=0)
{
if (value % 10 == 0) { contor++; value = value / 10 ;}
else break ;
}
if (contor == p) {g<< n ; break ;}
else n++;
}
return 0;
}