抓石子（博弈论）--异或和

#include <iostream>
using namespace std;

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n, k;
        cin >> n >> k;
        int wait;
        int ans = 0;
        for (int i = 1; i <= n; i++)
        {

            int cur;
            cin >> cur;
            if (i == k)//存下第k堆
            {
                wait = cur;
                continue;
            }
            ans ^= cur;
        }
        if (ans >= wait) //最小取1，从k开始拿后，剩余石子数取不到ans，即异或和不能为0
        {
            cout << "No" << endl;
        }
        else
        {
            cout << "Yes" << endl;
        }
    }
    system("pause");
    return 0;
}