Project Euler_Problem 301_Nim

原题目:

题目大意：Nim博弈

题解策略：对于Nim博弈，当各堆数量的异或为0则先手必输，否则先手必赢

代码：

void solve() {
    ll i, j, k, p, q, r, t;
    double a1, a2 = 0;
    NN = 10;
    ll a, b, c;

    ans1 = 0;
    for (i = 1; i <= (1 << 30); i++)
    {
        a = i;
        b = 2 * i;
        c = 3 * i;
        ll res = a ^ b ^ c;
        if (res == 0)ans1++;
    }


    
    printf("%lld\n", ans1);

}