[Hdoj 6312] Game

链接：http://acm.hdu.edu.cn/showproblem.php?pid=6312

---

Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Problem 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

---

题目大意：输入一个数n表示有一个含有1 - n所有数的集合，Alice和Bob轮流选择集合中的数，每次选一个数，删除集合中该数所有的因子，最后没有数可选的人输掉游戏。Alice先进行选择，求Alice是否必胜。

分析：因为1是所有数的因子，倘若集合中的数为 2 - n 时Alice必败，则Alice第一次可以选择2必胜，反之第一次选择1必胜，因此不管n是多少，Alice都是必胜的。

代码：

#include <iostream>
using namespace std;
int main()
{
    int n;
    while (cin >> n)
        cout << "Yes" << endl;
    return 0;
}