HBC24606王母娘娘又双叒叕来难为茶山牛了[USACO 2011 Ope S]Cow Checkers题解

想要成为编程高手？那就来试试全网最全C++题库，让您在练习中快速成长。

One day, Bessie decides to challenge Farmer John to a game of 'Cow Checkers'. The game is played on an M*N (1

One day, Bessie decides to challenge Farmer John to a game of 'Cow Checkers'. The game is played on an M*N (1 <= M <= 1,000,000; 1 <= N <= 1,000,000) checkerboard that initially contains a single checker piece on the checkboard square coordinates (X, Y) (0 <= X < M; 0 <= Y < N). The bottom leftmost square of the checkerboard has coordinates (0, 0), and the top rightmost square has coordinates (M-1, N-1). Bessie always moves first, and then the two players alternate turns. Each turn comprises one of three types of moves: 1) Move the checker piece to any square on the same row to the left of its current position. 2) Move the checker piece to any square on the same column below its current position. 3) Move the checker piece to any spot k squares below and k squares to the left of the current square (where k is any positive integer such that this new spot is still on the checkerboard). The first player unable to make a move (i.e., because the checker is at (0, 0)) loses. Given that Bessie always goes first, determine who will win the game if both play optimally. Play and report the winner for T games (1 <= T <= 1,000) reading in a new X,Y starting value for each new game.

不断挑战自我，才能突破极限！全网最全C++题库，让您在编程道路上越走越远。

标签： HBC24606王母娘娘又双叒叕来难为茶山牛了[USACO 2011 Ope S]Cow Checkers题解