这篇博客介绍了codeforces 120E问题，即在一个n*n的棋盘上轮流放置马，避免马之间攻击。文章通过分析得出结论：当棋盘边长为奇数时，先手有必胜策略；否则，后手有必胜策略。并提供了问题的解决方案和证明过程。
题目链接：传送门。
Petya and Gena play a very interesting game "Put a Knight!" on a chessboard n × n in size. In this game they take turns to put chess pieces called "knights" on the board so that no two knights could threat each other. A knight located in square (r, c) can threat squares (r - 1, c + 2), (r - 1, c - 2), (r + 1, c + 2), (r + 1, c - 2), (r - 2, c + 1), (r - 2, c - 1), (r + 2, c + 1) and (r + 2, c - 1) (some of the squares may be located outside the chessboard). The player who can't put a new knight during his move loses. Determine which player wins considering that both players play optimally well and Petya starts.
Input
The first line contains integer T (1 ≤ T ≤ 100) — the number of boards, for which you should determine the winning player. Next T lines conta
最低0.47元/天 解锁文章
扫一扫
265
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
