SPOJ FCTRL2

From Algorithmist

Contents 1 24 - Small Factorials 2 Summary 3 Explanation 4 Implementation 5 Input 6 Output

[edit] 24 - Small Factorials

• http://spoj.sphere.pl/problems/FCTRL2/

[edit] Summary

The problem asks us to calculate factorials of some small positive integers. This is a standard BigNum problem. Just preprocess the 100 possible answers and print it out when requested.

[edit] Explanation

This is a standard BigNum problem of calculating multiplications. Preprocessing the 100 possible answers will save us time.

[edit] Implementation

Const int MaximumNumberOfDigits = 158; // [log10(100!)]+1 // log(a*b) = log(a)+log(b)

[edit] Input

4
1
2
5
3

[edit] Output

1
2
120
6