Description: Enter a positive integer less than 1000, Output n! = 1X2X3 .... Xn accurate results 1000! Approximately equal to 4* 10 ^ 2567, so you can use a 3000 element array f preservation, for the convenience since we are saved from the low bits of data, and then reverse the output, that is, f [0] save a bit, so on the other hand each operator only needs to complete the simulation n!, leading to ignore output 0
To Search:
File list (Check if you may need any files):
1000's Factorial.c