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
4 1 2 5 3
Sample output:
1 2 120 6
hide comments
percy3538:
2017-10-29 09:13:18
when i implement the code in python it is easy but when using c, even an long long unsigned int can not hold the number, what do i use to implement the code in c? |
|
vivek2188:
2017-10-20 20:16:39
AC in single attempt :) NICE ONE |
|
zoyron:
2017-10-15 12:27:57
my code runs perfectly on my computer but it shows wrong answer on spoj. Last edit: 2017-10-15 12:28:15 |
|
loveiswar:
2017-10-05 20:23:02
on ideone all output is correct but why spoj is showing wrong ?? |
|
makali:
2017-09-28 18:54:03
I just submitted the solution in java but it shows compilation error,when I ideon it only shows the scala programming |
|
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 ? :/ |
Added by: | adrian |
Date: | 2004-05-28 |
Time limit: | 1s |
Source limit: | 2000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |