HDU 6312 GAME

泪湿孤枕 提交于 2020-10-28 10:29:21

Game

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


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. ( 1n500)
 

 

Output
A line for each test case, 'Yes' or 'No'.
 

 

Sample Input
1
 

 

Sample Output
Yes
 

 

Source
 

 

Recommend
chendu   |   We have carefully selected several similar problems for you:   6318  6317  6316  6315  6314 
【思路】:
其实这个就是个水题
选择肯定存在一胜一负,
假设按照这个选择,对方胜利,那么如果能在不影响局势的情况下,将对方跟己方的策略相反过来,
是存在这样的操作的,取1,可以不影响局势,然后还能交换一次次序,所以存在必胜操作。
故答案都为yes。
#include<cstdio>
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        printf("Yes\n");
    }
    return 0;
}

 

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!