Login
From:
cses.fi
(Uncensored)
subscribe
CSES - Two Knights
https://cses.fi/problemset/task/1072
links
backlinks
Roast topics
Find topics
Find it!
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.
