2018 Multi-University Training Contest 2.Game

Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 342    Accepted Submission(s): 246

 

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

 

Source

2018 Multi-University Training Contest 2

考点：博弈论

考虑将游戏变成初始时只有2~n，如果先手必胜的话，那么先手就这样取获胜；如果后手必胜的话，先手第一步取走 1 就获胜了。

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        printf("Yes\n");
    }
}