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
lordvidex:
20200223 00:26:26
why does python work excellently for this problem but C++ just can't? Is there a tweak to expanding the limit of numbers beyond long long int? 

sandipan2224:
20191202 19:20:23
Why isn't recursion working for large numbers?


ubc_123:
20190929 15:00:26
yea use an array for storing large numbers , : ) to overcome overflow 

dhia01:
20190726 12:13:58
array method Last edit: 20190726 14:18:51 

mahesh_1997:
20190717 19:23:01
Initially assumed that we must use java or other languages to calculate factorial of 100


pretam9:
20190709 19:41:38
why my code using dp is given WA? 

h_7:
20190626 10:15:51
i got the Test cases correct but got a wrong answer... 

vurise18:
20190615 05:41:56
any other solution than the biginteger? Last edit: 20190615 05:46:49 

tk_000:
20190610 02:33:55
tusharupadhyay


pyskmr:
20190530 19:39:57
python is a shit language,

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