Game（思维）

Game

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

题解

  如果所给集合[2-n]为必胜态 则赢；

如果所给集合[2-n]为必败态 则先手选1，相当于没选，赢。

神仙题

 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF){
        printf("Yes\n");
    }
    return 0;
}