All Tracks Math Problem

Small Factorials
Tag(s):

Ad-Hoc, Easy

Problem
Editorial
Analytics

You are asked to calculate factorials of some small positive integers.

Input
An integer T, denoting the number of testcases, followed by T lines, each containing a single integer N.

Output
For each integer N given at input, output a single line the value of N!

Input Constraint

1 <= T <= 100
1 <= N <= 100

SAMPLE INPUT
4
1
2
5
3
SAMPLE OUTPUT
1
2
120
6
Time Limit: 3.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

This Problem was Asked in

HackerEarth

Challenge Name

HackerEarth Practice Challenge

OTHER PROBLEMS OF THIS CHALLENGE
Notifications
View All Notifications