Fast Factorial Calculator 2

View as PDF

Submit solution

All submissions

Best submissions

Points: 20 (partial)

Time limit: 0.6s

Memory limit: 64M

Author:

Problem type

d is not in a good mood today, so he has decided to torment people. He wants you to write a large factorial calculator. More specifically, he wants you to calculate very very very large factorials. He wishes you luck.

Input Specification

The first line of input will contain the integer $N$ ~N~, $0 \le N \le 1\,000$ ~0 \le N \le 1\,000~, the number of cases to follow.

The next $N$ ~N~ lines will contain an integer $n$ ~n~, such that $0 \le n \le 2^{63}$ ~0 \le n \le 2^{63}~, whose factorial you are to calculate.

Output Specification

For every integer $n$ ~n~, you are to output $n! \pmod{2^{32}-5}$ ~n! \pmod{2^{32}-5}~.

Sample Input

2
5
13

Sample Output

120
1932053509

Comments

-19

Beautiful_Times commented on Nov. 12, 2017, 7:33 p.m.

Any hints on how to optimize the code, other than methods that were used in the first question

This comment is hidden due to too much negative feedback. Show it anyway.

29

BonyBen commented on Nov. 13, 2017, 6:20 a.m.

No

48

moladan123 commented on Nov. 2, 2016, 7:11 p.m. ← edited →

Good job d, you just turned a comment into a problem ;)

-5

elm224 commented on Nov. 2, 2016, 4:11 a.m.

For the sample output, wouldn't 13 factorial be 6227020800 or am I misunderstanding the question?

This comment is hidden due to too much negative feedback. Show it anyway.

6

nathanl3 commented on Nov. 2, 2016, 11:47 a.m.

For every integer $n$ ~n~, you are to output $n!$ ~n!~ (mod $2^{32}-5$ ~2^{32}-5~)