== include(page="template/taskheader" task_id="fairgame") ==

Alice and Bob are playing a game. They have a pile of N rocks. Alice makes the first move, then Bob does the second, and so on... In each turn, the player that has to move takes at least 1 rock and maximum K rocks. If one takes an odd number of rocks, then they have to pay M dollars. When the pile is empty, the player who made the last move gets P dollars and the other one gets Q dollars. Knowing that they play optimally, which means Alice wants to maximize the difference in dollars between them and Bob wants to minimize this difference.

Alice and Bob are playing a game. They have a pile of N rocks. Alice makes the first move, then Bob does the second, and so on... In each turn, the player that has to move takes at least 1 rock and maximum K rocks. If one takes an odd number of rocks, then they have to pay M dollars. When the pile is empty, the player who made the last move gets P dollars and the other one gets Q dollars. Knowing that they play optimally, which means Alice wants to maximize the difference in dollars between him and Bob wants to minimize this difference.

h2. Date de intrare