Pagini recente » Cod sursa (job #1633907) | Cod sursa (job #2840272) | Cod sursa (job #470765) | Cod sursa (job #2446632) | Cod sursa (job #999541)
Cod sursa(job #999541)
#include <iostream>
#include <fstream>
using namespace std;
int p = 0;
int factorial(int n)
{
int f=1;
for(int i = 2;i<=n;i++)
f *=i;
return f;
}
int cifre(int n)
{
int nr = 0, nr2 = 0;
while(n!=0){
if(nr2 == p)
break;
if(n%10 == 0)
{nr++;}
n /= 10;
nr2++;
}
return nr;
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
int i;
for(i = 1;; i++){
if(cifre(factorial(i)) == p)
break;
}
g<<i;
return 0;
}