Cod sursa(job #521770)
Utilizator | Data | 13 ianuarie 2011 12:24:21 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int n = 1, p, i, t;
FILE *f = fopen ("fact.in", "r");
FILE *g = fopen ("fact.out", "w");
fscanf (f, "%d", &p);
i = 0;
t = (pow (10, p)) ;
cout << t;
do {
++i;
n *= i;
}
while (n % t != 0);
fprintf (g, "%d", i);
return 0;
}