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
|
avatar:
2011-01-08 14:31:43
How to ensure 1<=n<=100. |
|
shivang:
2010-12-15 01:51:10
I am getting correct answer for every test case on my machine but on submission WA is coming. Could anyone guide me in the right direction. values that i have checked are - 1,2.....,15,71,100.......correct result for all of them. Thanks in advance :) |
|
:D:
2010-12-10 18:45:49
I'm not sure I understood you correctly. If your program is printing anything but the decimal numbers as a sequence of digits, than this is WA.
|
|
Kos:
2010-12-10 17:02:44
what's wrong with perl? i tested my solution with 100, 100, ..., and everything was ok. but here i get WA, is it because perl use exponential notation for big numbers? |
|
Nebojsa:
2010-11-28 09:10:09
why is it that i have to resubmit my solution , and why does it say my programing language is ada then its C |
|
Broteen Kundu:
2010-10-09 13:51:17
my compiler is giving no error, but when im submitting my solution, its coming compile time error! what should i do?? |
|
sashidhar:
2010-10-02 16:28:07
Last edit: 2010-10-03 06:02:09 |
|
coder:
2010-05-31 17:35:54
100! is 933262154439441526816992388562667004907159682643816214685929638952175999932
|
|
Seshadri R:
2010-05-17 05:55:47
@Subhajit Sadhu: The data type (int, unsigned or long long unsigned) used by you for holding the result could have been too small and an arithmetic overflow would have resulted |
| Added by: | adrian |
| Date: | 2004-05-28 |
| Time limit: | 1s |
| Source limit: | 2000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
RSS