HDU6312: Game 题解

Description

Alice and Bob are playing a game.
The game is played on a set of positive integers from 1 to n.
In one step, the player can choose a positive integer from the set, and erase all of its divisors from the set. If a divisor doesn’t exist it will be ignored.
Alice and Bob choose in turn, the one who cannot choose (current set is empty) loses.
Alice goes first, she wanna know whether she can win. Please judge by outputing ‘Yes’ or ‘No’.

Input

There might be multiple test cases, no more than 10. You need to read till the end of input.
For each test case, a line containing an integer n. (1≤n≤500)

Output

A line for each test case, ‘Yes’ or ‘No’.

Sample Input

1

Sample Output

Yes

Source

2018 Multi-University Training Contest 2

---

这题还是挺有趣的
如果把这种约数关系建成一个DAG的话，胜败取决于现场联通块个数的奇偶性
我刚开始感觉先手非常厉害，应该能控制奇偶性的走向，所以直觉觉得先手必胜，于是就狂打Yes，然后竟然就过了
看了杜教的题解觉得很神
如果n=1，那么先手必胜
否则考虑一个新游戏，2到n这些数排成一排，规则和这个游戏一样
如果这个新游戏先手必胜，那么就按照这个游戏的先手必胜策略走第一步，因为1是任何数的约数，所以走这步的同时会把1消掉
如果这个新游戏先手必败，那么先手第一步把1拿掉就行了
所以原游戏先手必胜

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

int main ()
{
    int n;
    while (~scanf("%d",&n)) puts("Yes");
    return 0;
}