Pagini recente » Cod sursa (job #275988) | Cod sursa (job #3296709) | tema | Cod sursa (job #519148) | Cod sursa (job #2429808)
#include <iostream>
#include <cmath>
uint64_t factorial(int N){
if(N > 1){
return N * factorial(N - 1);
} else {
return 1;
}
}
int main() {
int P, k = 1;
uint64_t impartire;
FILE * fisier_out = fopen("fact.out", "w");
FILE * fisier_in = fopen("fact.in", "r");
fscanf(fisier_in, "%d", &P);
while(1){
impartire = factorial(k);
for(int i = 0; i < P; i++){
impartire = impartire / 10;
}
if((impartire * pow(10, P)) == factorial(k)){
fprintf(fisier_out, "%d", k);
break;
}
k = k + 1;
}
fclose(fisier_in);
fclose(fisier_out);
return 0;
}