The King's Race【数学】

最新推荐文章于 2020-12-25 17:30:23 发布

「已注销」

最新推荐文章于 2020-12-25 17:30:23 发布

阅读量521

点赞数

CC 4.0 BY-SA版权

文章标签：数学

本文链接：https://blog.youkuaiyun.com/YT201758501112/article/details/83901110

这是一个关于国王在棋盘上赛跑的问题，白棋从(1,1)出发，黑棋从(n,n)出发，目标是到达坐标(x,y)。通过判断目标点相对于棋盘对角线的位置来确定哪位国王会先到达并赢得比赛。" 104283323,9314357,Lua学习基础：程序块、词法规范与全局变量,"['lua', '编程语言']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The King's Race

CodeForces - 1075A

On a chessboard with a width of nn and a height of nn, rows are numbered from bottom to top from 11 to nn, columns are numbered from left to right from 11 to nn. Therefore, for each cell of the chessboard, you can assign the coordinates (r,c)(r,c), where rr is the number of the row, and cc is the number of the column.

The white king has been sitting in a cell with (1,1)(1,1) coordinates for a thousand years, while the black king has been sitting in a cell with (n,n)(n,n) coordinates. They would have sat like that further, but suddenly a beautiful coin fell on the cell with coordinates (x,y)(x,y)...

Each of the monarchs wanted to get it, so they decided to arrange a race according to slightly changed chess rules:

As in chess, the