20140715 「博弈 - Nim（尼姆）博弈」 HDOJ 2509 Be the Winner-CSDN博客

本文链接：https://blog.csdn.net/wilson1068/article/details/37820477

Online Judge	Online Exercise	Online Teaching	Online Contests	Exercise Author
F.A.Q Hand In Hand Online Acmers Forum \| Discuss Statistical Charts	Problem Archive Realtime Judge Status Authors Ranklist	C/C++/Java Exams ACM Steps Go to Job Contest LiveCast ICPC@China	STD Contests VIP Contests Virtual Contests DIY \| Web-DIY ^beta Recent Contests	wilson1068 Mail 0 (0) Control Panel Sign Out

7月22-8月21多校联合训练期间，会根据实际负载关闭部分模块，若有不便，请谅解~

Be the Winner

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

Problem Description

Let's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can take any number of consecutive apples at one time.
For example "@@@" can be turned into "@@" or "@" or "@ @"(two piles). two people get apples one after another and the one who takes the last is
the loser. Fra wants to know in which situations he can win by playing strategies (that is, no matter what action the rival takes, fra will win).

Input

You will be given several cases. Each test case begins with a single number n (1 <= n <= 100), followed by a line with n numbers, the number of apples in each pile. There is a blank line between cases.

Output

If a winning strategies can be found, print a single line with "Yes", otherwise print "No".

Sample Input

Sample Output

Source

ECJTU 2008 Autumn Contest

Recommend

lcy | We have carefully selected several similar problems for you: 2516 2512 2510 2515 1536

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2014 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.024589(s) query 5, Server time : 2014-07-15 17:43:27, Gzip enabled

Administration

博弈：还是尼姆博弈模板一份

题解嘛，有空再补。。。

#include <stdio.h>
#define MAXN 111
int main(){			//freopen("Be.in","r",stdin);
	int a[MAXN], n;
		while( EOF != scanf("%d", &n) ){
			int sum = 0, ans = 0;
			for(int i=0; i<n; i++){
				scanf("%d", &a[i]);
				sum ^= a[i];
				if( a[i]>1 )	ans = 1;
			}
			if( ans )	printf("%s\n", sum ? "Yes":"No");
			else		printf("%s\n", n&1 ? "No":"Yes");
		}
	return 0;
}