【博弈】Game HDU6312 2018多校第二场

Game

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

 

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

 

 

 

结果我们已经知道，全输出"Yes"，其实思路也很简单：我们可以这样想，若先手有优势，则Alice自然获胜，若后手有优势，则Alice先取走1（1是所有数的因子），这样一来自己就变成了后手，这样还是Alice获胜。