Pagini recente » Cod sursa (job #2434945) | Cod sursa (job #1186472) | Cod sursa (job #24729) | Cod sursa (job #2423566) | Cod sursa (job #1390014)
#include<iostream>
#include<fstream>
using namespace std;
long factorial(long nr );
int main()
{
long p,n=1,fact,i,aux=1;
int ok=0;
ifstream f("fact.in");
f>>p;
f.close();
if( p<=0 && p>=1e+8 ){
cout<<"Numarul citit din fisier nu se incadreaza in limitele acceptate!"<<endl;
return 0;
}
for( i=1;i<=p;i++ ){
aux=aux*10;
}
while( ok == 0 ){
if( factorial(n) %aux == 0 ){
ok=1;
}
else{
if( n==1 ){
n=n+4;
}
else{
n=n+5;
}
}
}
// cout<<n<<" "<<factorial(n)<<endl;
ofstream g("fact.out");
g<<n;
f.close();
return 0;
}
long factorial(long nr )
{
int i;
long fact=1;
for( i=1;i<=nr;i++ ){
fact=fact*i;
}
return fact;
}