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
|
supercool2204:
2017-01-03 07:31:39
Beware of :Your solution is too long for this problem, the limit is 2000 bytes! :D
|
|
k_359:
2017-01-02 10:31:37
I'm getting correct answer on ideone but here it is showing wrong answer. :( |
|
psiphon_exe:
2017-01-01 16:29:24
You need to solve this problem using basic multiplication. |
|
thumpri:
2016-12-29 19:11:51
I'm using long double and %.0Lf in c. It's working fine on my pc. WA here. Any idea anyone? :/
|
|
holmesherlock:
2016-12-18 17:05:25
will someone please tell me the format of input and output.....tried both ways(displaying all the results at last and displaying it instantly )..but getting WA...
|
|
addynation:
2016-12-02 14:58:20
int cannot store factorial of 100.
|
|
ashishsb95:
2016-11-27 15:06:30
day#2problem#5
|
|
shekarmania:
2016-11-04 18:39:08
using loops instead of arrays is easy :( |
|
kritisingh1:
2016-10-29 08:48:34
the code worked correctly on ideone, still here it says "wrong answer". Why? |
|
dpgc11:
2016-10-09 15:47:22
I am getting the correct answer but still it's telling me it's wrong.(Not using println in the last line) |
| Added by: | adrian |
| Date: | 2004-05-28 |
| Time limit: | 1s |
| Source limit: | 2000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
RSS