Pagini recente » Atasamentele paginii Clasament 1313 | Istoria paginii utilizator/toni4447 | Istoria paginii utilizator/onofrei_radu | Istoria paginii utilizator/alexandrujamborivaleriu | Cod sursa (job #1002992)
#include <iostream>
#include <fstream>
using namespace std;
int factorial(int n)
{int i,s=1;
for (i=1;i<=n;i++)
s=s*i;
return s;
}
int cifra(int a)
{int p=0,uc;
while (a!=0)
{ uc=a%10;
if (uc==0)
{
p++;
a=a/10;
}
else break;
}
return p;
}
int main()
{ ifstream f ("fact.in");
ofstream g ("fact.out");
int p,nr=-1,i=0;
f>>p;
while (nr<p)
{
i++;
if (cifra(factorial(i))==p)
{
g<<i<<" ";
nr=p+1;
}
else
nr=cifra(i);
}
}