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
awadhesh_123:
20180512 07:09:15
I am using double and I get 162 decimal place for 100! but still, I am getting the wrong answer. 

thunderbird18:
20180426 05:41:26
finally accepted!!!! Ac 0.02 

siva2697:
20180403 20:34:28
NOT RECOMMENDED 

frustrated:
20180330 16:01:43
What is the problem with java compiler of SPOJ??? Everytime it is giving Runtime error, where I can easily run it in my IDE,without any exception or error!!!!!!!!!!!!!! 

c_siddhesh11:
20180328 17:26:38
is it ok if i display result after i accept numbers


atlanta_bear:
20180309 15:58:48
getting SIGSEGV with C++, any ones faced this before??


pshishod2645:
20180118 17:44:01
to all who are wondering why it's giving wrong answer on spoj while not on their systems,n is upto 100,but even long long int can score atmost 20!(it's too big),use strings with your own multiply function for strings


prakash1108:
20171226 13:03:53
on ideone all output is correct but on spoj it is showing wrong answer.why?? 

roberttz:
20171212 22:02:38
Use string instead of numbers and make your own way to mulitiply strings 

charlles:
20171208 02:30:05
in C you need to build a function that work with int* from 0 to 9 to represent the 100! (which have more than 158 decimal places) Last edit: 20171208 15:25:14 
Added by:  adrian 
Date:  20040528 
Time limit:  1s 
Source limit:  2000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 