Whu oj 1604 - Play Apple

非常可乐（이녕）

于 2016-04-09 19:53:01 发布

阅读量348

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈题

本文链接：https://blog.youkuaiyun.com/wyjwyl/article/details/51106977

题同时被 2 个专栏收录

47 篇文章

订阅专栏

博弈

3 篇文章

订阅专栏

本文介绍了一个简单的两人轮流操作的游戏——苹果博弈。游戏的目标是通过将苹果堆分成两堆且数量不等，或选择一堆作为下一轮起点的方式进行，直至某方无法继续游戏则判为输。文章提供了一个简洁的C++程序实现，用以判断初始状态下先手玩家是否能通过最优策略获胜。

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

Problem 1604 - Play Apple

Time Limit: 1000MS Memory Limit: 65536KB
Total Submit: 422 Accepted: 171 Special Judge: No

Description

There are N apples. Two people take turns to either:
1. Divide the apple into two piles with different numbers.
2. The other people selects a pile of apples as the beginning of the next turn.
If someone can not meet the requirements, he is lost. Will the first one win the game if both use the best strategy?

Input

There are multiple test cases.
The first line of each case contains a integer N. ( 1 <= N <= 1000000000 )

Output

If the first person will win, output “Yes”. Otherwise, output “No”.

Sample Input

2
3
4

Sample Output

No
Yes
No

从1和2 开始考虑，之后规律就出来了

1 N 2N 3Y 4N 5Y 6Y 7N 8Y 9Y 10N

#include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
int main()
 {
     int n;
     while(scanf("%d",&n)!=EOF)
     {
         if(n==2)
         {
             printf("No\n");
             continue;
         }
         int t=n%3;
         if(!t)
             printf("Yes\n");
         if(t==1)
             printf("No\n");
         if(t==2)
             printf("Yes\n");
     }
     return 0;
 }