All submissions for this problem are available.On a Fine Day, there is some group who are sitting on the beach and the Chef was one among them. There is a beautiful girl sitting on the shore with her Laptop and struggling for a problem in Codechef Long Challenge. The Chef and his group wanted to impress the girl and approaches her and asks for a date. The girl passes a condition that the one who solves this problem first will get a date. As Chef is not that good at Mathematics, He finds it difficult to solve. But the Chef has many connections So he asks for your help. Help the Chef to impress the girl by solving this problem. $function(n)$= (n)1 * (n-1)2 * (n-2)3 ...... (4)n-3 * (3)n-2 * (2)n-1 * (1)n So you need to find the $function(n)$ Since this number could be large Compute it Modulo $1000000007$. ### Input - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, $N$ ### Output - For each test case, output in a single line the value of $function(n)$ mod $1000000007$ ### Sample Input 3 3 7 9 ### Sample Output 12 411327125 550584158 ### Constraints - $1 \leq T \leq 100000$ - $1 \leq N \leq1000000$
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, SQL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.