D - Problem D. Game HDU - 6312

最新推荐文章于 2022-07-09 09:59:33 发布

weixin_30667301

最新推荐文章于 2022-07-09 09:59:33 发布

阅读量74

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/SutsuharaYuki/p/11224337.html

本文介绍了一个基于整数集合的游戏策略，玩家需选择并移除数及其倍数，目标是使对手无法操作而胜出。文章提供了游戏规则说明及简单的获胜策略分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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≤500Output

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

Sample Output

Yes

简单分析
1）一定会由某一方赢，不存在平局。
2）在第一步不取1的情况下 第一条成立
3）先手可以取1
=>所以对于任意一种情况，
　　若先手不取1必输，则先手取1必赢；
　　若先手取1必输，则先手不取1必赢；
=>先手必赢

1 #include <bits/stdc++.h>
2 using namespace std;
3 int main(){
4     int t;
5     while(cin>>t)
6         cout<<"Yes"<<endl;
7 }

转载于:https://www.cnblogs.com/SutsuharaYuki/p/11224337.html