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
|
anushka_ahuja:
2018-05-12 21:35:18
i m using array and made my own function to multiply them and it is giving 100! on codeblocks but WA here what should i do?
|
|
awadhesh_123:
2018-05-12 07:09:15
I am using double and I get 162 decimal place for 100! but still, I am getting the wrong answer. |
|
thunderbird18:
2018-04-26 05:41:26
finally accepted!!!! Ac 0.02 |
|
siva2697:
2018-04-03 20:34:28
NOT RECOMMENDED |
|
frustrated:
2018-03-30 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:
2018-03-28 17:26:38
is it ok if i display result after i accept numbers
|
|
atlanta_bear:
2018-03-09 15:58:48
getting SIGSEGV with C++, any ones faced this before??
|
|
pshishod2645:
2018-01-18 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:
2017-12-26 13:03:53
on ideone all output is correct but on spoj it is showing wrong answer.why?? |
|
roberttz:
2017-12-12 22:02:38
Use string instead of numbers and make your own way to mulitiply strings |
| Added by: | adrian |
| Date: | 2004-05-28 |
| Time limit: | 1s |
| Source limit: | 2000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
RSS