FCTRL2  Small factorials
You are asked to calculate factorials of some small positive integers.
Input
An integer t, 1<=t<=100, denoting the number of testcases, followed by t lines, each containing a single integer n, 1<=n<=100.
Output
For each integer n given at input, display a line with the value of n!
Example
4 1 2 5 3
Sample output:
1 2 120 6
hide comments
resetius:
20210321 22:50:09
Used fortran and array  integer(8), dimension(1000) :: Array 

yoddha_99:
20210209 18:56:23
I'm a faggot Last edit: 20210209 23:43:47 

deep_97:
20210118 21:12:41
Using vector to store the answer makes it easier to solve in C++. Using Java BigInteger or using Python will not help in learning. 

beingsubham:
20210103 08:33:30
its showing your solution is too long


starizwan:
20201227 18:24:06
Used arrays in reverse order got AC after many attempts :(( 

lamda_cdm_10:
20201222 15:08:25
Use the vectors in reverse order 

aaronphilip_03:
20201205 22:02:35
I just finished this program using arrays in a reverse order in C++. For those of you you'll doing it with the traditional method of calculating a factorial, your answer is not wrong but, while the solution is being checked you will get an error because it is trying to calculate a factorial of a very large number between 1 and 100.


satyam_656:
20201125 16:12:27
DO with c++ and use array in reverse order to store the answer. 

samiya_ahmed5:
20201106 13:32:13
it can be solved using cpp .. the key idea is to keep the answer in an array .... 

thanos_tapras:
20200905 17:22:18
I don't think c++ is ideal here. Python (or bigInt with Java) is the way to go. Last edit: 20200905 17:22:37 
Added by:  adrian 
Date:  20040528 
Time limit:  1s 
Source limit:  2000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 