The stones game

The Stones Game【 Take a stone game & thinking 】

notes

2020.7.22 Supplementary questions

Problem G. The Stones Game

The question

Yes n A stone ,m A contestant

Each player has to do 2 Step by step ：

（1） Take a stone or not

（2） If the operation of the last player （1） It was a stone Or the current player is 1 Contestant No , Then you can't take a stone in this step , conversely , You have to take a stone .

" if this is not the first turn and in the previous turn the player decided not to remove a stonein his/her first step, then the current player must remove a stone in this step" This sentence is hard to understand ~, Turn it into a negative sentence ,and become or, You can get the above sentence .

Who finally takes the stone and sleeps wins , ask n A stone ,m Players go down ,y Whether it is in a must win state .

analysis

1 Contestant No （1） Bu took the stone ,（2） You can't take a stone , that 2 Contestant No （1） You can choose to take it or not , The first （2） Step can not take .

therefore 2 Players should take at least 1 A stone , At most 2 A stone 、

If there is 3 A contestant , You can also push and take the most 3 individual , At least take 2 individual .

So if there is 3 A contestant , Need to take 3 A stone , that 3 Player No. 1 is a must win .

Yes n A stone ,m When a player ,n%m Player No. 1 is a must win .

#include "bits/stdc++.h"
using namespace  std;
int main()
{
    int cas;
    scanf("%d",&cas);
    while (cas--)
    {
        int n,m,y;
        scanf("%d %d %d",&n,&m,&y);
        int k=n%m;
        if(k==0)k=m;
        if(y==k)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}