Pagini recente » Cod sursa (job #486487) | Cod sursa (job #2424909) | Cod sursa (job #323852) | Cod sursa (job #2564151) | Cod sursa (job #507175)
Cod sursa(job #507175)
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
unsigned long int n=1, p, ucif=0, ok=0, count=0, factorial=1, i;
ifstream fin("fact.in");
ofstream fout("fact.out");
fin >> p;
while(ok == 0)
{
factorial = 1;
for(i=1;i<=n;i++)
{
factorial = factorial * i;
}
cout << factorial << endl;
while(ucif == 0)
{
ucif = factorial % 10;
factorial = factorial / 10;
count++;
}
count = count - 1;
if(count == p)
{
ok = 1;
fout << n;
}
n++;
count = 0;
ucif = 0;
}
fin.close();
fout.close();
return 0;
}