Hdu1042 Big Data factorial

# Include <cstdio> # include <string. h> using namespace STD; const int maxn = 50000; int f [maxn]; int main () {int I, j, N; while (scanf ("% d ", & N )! = EOF) {memset (F, 0, sizeof (f); F [0] = 1; // first set the single position to 1 for (I = 2; I <= N; I ++) // multiply from 2 to n {int C = 0; // the number of reserved incoming bits for (j = 0; j <maxn; j ++) // traverse the f Array {int S = f [J] * I + C; // calculate the value of each bit f [J] = S % 10; // update the value of the array after each multiplication c = s/10; // C reserved incoming bits} For (j = maxn-1; j> = 0; j --) // ignore leading 0 if (F [J]) break; for (I = J; I> = 0; I --) // output printf ("% d ", f [I]); printf ("\ n");} return 0 ;}

Open the array by 50000, and feel that you can do this only when you are truly integrated into the question.