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

Sample input:
4
1
2
5
3

Sample output:

1
2
120
6

hide comments
hitesh87: 2017-09-16 13:37:13

Very interesting problem implement using array or use bigintegers

kush1729: 2017-08-25 08:19:11

on ideone all output is correct but why spoj is showing wrong ??

chetan_555: 2017-08-24 17:15:30

use bigintegers and implement in java

vanshajchadha: 2017-07-21 08:02:09

why is my answer showing the factorial of large numbers as 0 when i am evaluating the factorial recursively.

rahulnair95: 2017-07-10 23:13:50

Im getting the correct answer for everything even 0,1 and 100. Why is it showing wrong answer ? :/

bobjarvis: 2017-07-03 21:22:31

vishwajeet404 - to keep people from putting in all the factorials from 1 to 100 as literals in an array and then just pulling them out of the array.

vishwajeet404: 2017-07-03 20:34:52

I had to fight tooth and nail to get the source code to be smaller than 2000B, why such a small limit?

shivltd: 2017-06-21 19:24:11

True happiness is completing this in c++ by creating your own big number range from scratch and no resources.
Problems people might encounter:
1. 100!(therefore the large number)
2. 0!(let it go)
3. Print endline after printing numbers. People face issues with that. Cheers. :")

tusharuppal: 2017-06-18 11:24:49

basic qn....AC in one go ;-)

bhawna_123: 2017-06-17 19:18:01

If u are a c/c++ programmer just read their tutorial of same problem.


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