A Row of Pascal's Triangle

Difficulty: 1300 3000 ms 128 MB

math combinatorics

Print row N of Pascal's triangle (row 0 is 1), each entry modulo 10⁹+7.

Input: one integer N.

Output: the N+1 entries C(N,0) ... C(N,N) mod 10⁹+7.

Constraints:

• 0 ≤ N ≤ 10⁵

Sample Tests

4

1 4 6 4 1

0

1

Read the Editorial