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

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

hide comments
2016-05-02 02:24:58
I coded and tested in C++14 and it is working for 200! as well but source limit is not letting me submit :)

Last edit: 2016-05-06 06:12:34
2016-03-31 13:14:25
getting runtime error as SIGABRT
what to do plz help !!! (code is in c++)
2016-03-25 19:27:14
BigInteger in java -> ok :D

Last edit: 2016-03-25 19:28:06
2016-03-24 19:42:34
getting wa,even when the code does what is asked. :(
2016-03-18 19:12:58
my answer is right, but it says it isnt??
what dafuq is happening?
2016-02-29 12:49:52
Giving wrong answer. Mine's right though.... :(
2016-02-23 14:32:53
0.0 in c...<3
2016-02-17 15:51:30 rahul_verma
yes!!!! done It :p
2016-02-09 17:37:08
made my own big int even can calculate 1000! !!!!!!!!!!!!!!!!!!!!
feeling proud.....
2016-02-05 07:58:18
Proud to be one of the warriors who rolled their own C++ big-number to solve this problem.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.