Two Knights

CSESIntroductory ProblemsOpen on judge ↗

Your task is to count for k=1,2,\ldots,n the number of ways two knights can be placed on a k \times k chessboard so that they do not attack each other. Input The only input line contains an integer n. Output Print n integers: the results. Constraints - 1 \le n \le 10000 Example Input: 8 Output: 0 6 28 96 252 550 1056 1848

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI