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
Input: 4 1 2 5 3 Output: 1 2 120 6
hide comments
gordon_zhang:
20240628 06:31:48
It's quite easy to solve this problem with Python. :p 

sevix:
20240410 14:14:18
i do recomend this:) 

crazymakibe:
20240322 15:11:59
java solution using ArrayList is not accepted!


akane86:
20230701 11:56:27
why does long long not work? because 100! will be much larger than this! 

its_mithu:
20230503 18:00:11
The decent way of getting AC in this problem is the use of vector or string. 

iamdikshith:
20230214 15:41:48
python handles it as the most basic problem! 

pavlopare:
20230129 07:23:14
plain C is working here (0.01sec , no special math, no long types)


aoteki:
20230127 06:14:55
This doesn't work in Prolog. the code works correctly in Codewars for a similar Factorial problem. 

himanshuo7:
20221106 18:22:47
Solved using custom string multiplication! 

kaala:
20220528 18:36:49
segregaate the multiplication system on a vector or an array.

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