Fast Factorial Calculator 2

View as PDF

Submit solution


Points:30 (partial)
Time limit:1.0s
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 contains the integer N, 0 \le N \le 1\,000, the number of cases to follow.

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

Output Specification

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

Sample Input

2
5
13

Sample Output

120
1932053509

Report an issue

Comments


  • -5
    Beautiful_Times
     commented on Nov. 12, 2017

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


    • 5
      BonyBen
       commented on Nov. 13, 2017

      No


  • 13
    moladan123
     commented on Nov. 2, 2016
    Yay

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


  • 0
    elm224
     commented on Nov. 2, 2016
    oops

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


    • 3
      nathanl3
       commented on Nov. 2, 2016

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