Pagini recente » Cod sursa (job #2330544) | Cod sursa (job #2253944) | Cod sursa (job #887949) | Cod sursa (job #460619) | Cod sursa (job #471175)
Cod sursa(job #471175)
#include <fstream.h>
#include <iostream>
#include <math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int factorial (int n){
int p=1;
for(int i=2;i<=n;i++){
p=p*i;
}
return 0;
}
int main(){
long int i;
int a[8];
for(int c=0;c<=8;c++){
a[c]=c+1;
}
f>>i;
for(int z=1;z<pow(10,4);z++){
for(int d=0;d<=8;d++){
if((factorial(z)/pow(10,i+1))==a[d]){
g<<z;
break;
}
else if((factorial(z)/pow(10,i+1))>a[d]){
return -1;
break;
}
}
f.close();
g.close();
return 0;
}