Educational Codeforces Round 169 (Rated for Div. 2) E

CF2004E Not a Nim Problem

题目：

Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with the $i$-th pile initially containing $a_i$ stones.

On their turn, a player can choose any pile of stones and take any positive number of stones from it, with one condition:

• let the current number of stones in the pile be $x$. It is not allowed to take from the pile a number of stones $y$ such that the greatest common divisor of $x$ and $y$ is not equal to $1$.

The player who cannot make a move loses. Both players play optimally (that is, if a player has a strategy that allows them to win, no matter how the opponent responds, they will win). Alice goes first.

Determine who will win.
Input

The first line contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

Each test case consists of two lines:

• the first line contains a single integer $n$ ($1\le n\le 3\cdot 10^5$);
• the second line contains $n$ integers $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 10^7$).

Additional constraint on the input: the sum of $n$ across all test cases does not exceed $3\cdot 10^5$.
Output

For each test case, output Alice if Alice wins, or Bob if Bob wins.

分析：

令石子数为 $x$ ，则：
$x$ 为偶数时，$sg(x)=0$ 。
$x$ 为奇数时，若 $x$ 为质数，则 $sg(x)=x是第几个质数$ ，否则 $sg(x)=sg(min{p}_x)$ ，$min{p}_x$ 为 $x$ 的最小质因子。
$sg(0)=0,sg(1)=1,sg(2)=0,sg(3)=2$ ，当 $x$ 不为质数时，石子数不能变为 $min{p}_x$ 的倍数，并且 $x$ 可以变为 $\forall y\in [1,min{p}_x-1]$ ，石子数为 $min{p}_x$ 时，也能变为 $\forall y\in [1,min{p}_x-1]$，因此 $sg(x)\ge sg(min{p}_x)$ 。但 $x$ 不能变为 $min{p}_x$ 的倍数的石子数，即所能到达的 $sg$ 值没有 $sg(min{p}_x)$ ，因此 $sg(x)=sg(min{p}_x)$ 。

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e7 + 10;

int primes[N], minp[N], sg[N], cnt;
bool vis[N];

void init() {
    int mex = 1;
    sg[1] = 1, sg[0] = 0;
    for(int i = 2; i < N; i ++ ) {
        if(!vis[i]) {
            primes[cnt ++ ] = i, minp[i] = i, sg[i] = mex ++ ;
            if(i == 2) {
                sg[i] = 0;
            }
        }
        for(int j = 0; 1ll * primes[j] * i < N; j ++ ) {
            vis[primes[j] * i] = true;
            if(i % primes[j] == 0) {
                minp[primes[j] * i] = minp[i];
                sg[primes[j] * i] = sg[minp[i]];
                break;
            }
            minp[primes[j] * i] = primes[j];
            sg[primes[j] * i] = sg[primes[j]];
        }
    }

    // for(int i = 0; i <= 100; i ++ ) {
    //     cout << "sg[" << i << "] = " << sg[i] << '\n';
    // }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    init();
    int T;
    cin >> T;
    while(T -- ) {
        int n;
        cin >> n;
        vector<int> a(n);
        for(auto &x : a) cin >> x;

        int ans = 0;
        for(auto x : a) ans ^= sg[x];
        cout << (ans ? "Alice" : "Bob") << '\n';
    }
    return 0;
}