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
2020-06-04 17:43:53
My answer is totally correct ans it's saying wrong answer.WHy!!!!!!!!!!!!
2020-06-01 20:26:24
define a function and map every input to it in Python!
2020-05-25 13:07:23
You must should know, how to add and multiple big numbers using strings

Last edit: 2020-05-25 13:09:18
2020-05-24 20:36:20
Don't use any library functions in this function... that's the goal of this problem
2020-05-21 21:37:22
try bigint for java or c++
2020-05-20 05:11:30
use boost library ,learn it from tutorial point and do simple factorial

Last edit: 2020-05-20 05:12:38
2020-05-08 12:17:24
spoilers for c++ users:
use string for multiplying and storing large numbers(may be just write a function for multiplying digit by digit)
<duh! obvious>

Last edit: 2022-09-17 23:08:56
2020-05-06 22:03:55
why this code work in python? not in c++.
2020-04-18 15:26:55
For C++, we can just use multiprecession library :)
2020-04-09 14:19:05
well!java bigint rocks!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.