WHU 1604 - Play Apple【博弈】

线条小狗LLL

于 2016-04-16 18:18:20 发布

阅读量379

点赞数

CC 4.0 BY-SA版权

分类专栏：＝＝＝＝C&＆C++＝＝＝＝

本文链接：https://blog.youkuaiyun.com/lin14543/article/details/51169392

＝＝＝＝C&＆C++＝＝＝＝专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一个简单的两人轮流操作的游戏——分苹果游戏，并给出了基于博弈论的最优策略分析及实现代码。游戏规则为两人轮流将苹果堆分成两堆数量不等的苹果，或选择一堆作为下一轮起点，直至无法继续游戏者失败。

Problem 1604 - Play Apple

Time Limit: 1000MS Memory Limit: 65536KB
Total Submit: 457 Accepted: 182 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

AC-code：

#include<cstdio>
int main()
{
	long long n;
	while(~scanf("%lld",&n))
	{
		if(n%3==1||n==2)
			printf("No\n");
		else
			printf("Yes\n");
	}
	return 0;
 }