Two Peaceful Knights

Difficulty: 1600 2000 ms 128 MB

math combinatorics

For every board size k = 1..N, count the ways to place two knights on a k×k chessboard so they do NOT attack each other. Print N lines.

Input: one integer N.

Output: N lines: the count for each k.

Constraints:

• 1 ≤ N ≤ 10⁴

Sample Tests

3

0
6
28

1

0

Read the Editorial