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
oyutommy:
20220424 08:06:16
using long long is not gonna work 

nowshadsub15:
20220114 19:12:16
solved in c, used library strrev function but CE was shown, so implemented it in the source code and got AC . 

rz_ai:
20220109 15:15:03
Can I use boost multiprecision ?? 

hitesh_12345:
20211214 06:22:11
Be careful!!! Use line break at end of each testcase.. 

rishi_48:
20211022 07:56:16
For those using Java, use BigInteger Class!! 

manoj_goud:
20211010 05:08:39
Actually 100! cant be stored in long long also, so use different approach


hetian520:
20210927 14:33:47
Use python for ac. I've used C++ with traditional recursion function but got wrong answer all time. So I've used Python with factorial recursion and got ac with ease. Happy Coding. Last edit: 20210927 14:34:16 

resetius:
20210321 22:50:09
Used fortran and array  integer(8), dimension(1000) :: Array 

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

Added by:  adrian 
Date:  20040528 
Time limit:  1s 
Source limit:  2000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 