hdu6312

Game

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

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

Recommend

chendu   |   We have carefully selected several similar problems for you:  6318 6317 6316 6315 6314 

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2018 HDU ACM Team. All Rights Reserved. Designer & Developer : Wang Rongtao LinLe GaoJie GanLu Total 0.046800(s) query 7, Server time : 2018-07-26 09:41:53, Gzip enabled

Administration

题意：给你1~n数，每个人在其中选一个数，然后删去它的因子，谁最后不能取则输。

解析;对于每一个对局，肯定有赢有输。我们可以发现，1是任何数的因子，它在这里面相当于可有可无（因为无论选谁，都可以去掉1）。所以，我们可以这样想：

1.要是对于2~n的局面，先手要是输的话，我们就先取1，把败局留给后手，这样可以保证先手肯定赢。

2.要是对于2~n的局面，先手要是赢的话，我们就随意取一个2~n的数。这样胜局就是先手的。

综合所述，先手肯定赢。

#include<bits/stdc++.h>
using namespace std;

#define e exp(1)
#define pi acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))

int main()
{
    int n,;
    while(~scanf("%d",&n))
    {
        puts("Yes");
    }
 
}