南邮 OJ 1127 Stick

最新推荐文章于 2018-09-07 20:00:10 发布

chenrujun2010

最新推荐文章于 2018-09-07 20:00:10 发布

阅读量364

点赞数

分类专栏：南邮 OJ 文章标签：南邮OJ ACM Stick

本文链接：https://blog.csdn.net/changshu1/article/details/47291549

版权

南邮 OJ 专栏收录该内容

453 篇文章 44 订阅

订阅专栏

Stick

时间限制(普通/Java) : 2000 MS/ 6000 MS 运行内存限制 : 65536 KByte
总提交 : 194 测试通过 : 92

比赛描述

Anthony has collected a large amount of sticks for manufacturing chopsticks. In order to simplify his job, he wants to fetch two equal-length sticks for machining at a time. After checking it over, Anthony finds that it is always possible that only one stick is left at last, because of the odd number of sticks and some other unknown reasons. For example, Anthony may have three sticks with length 1, 2, and 1 respectively. He fetches the first and the third for machining, and leaves the second one at last. Your task is to report the length of the last stick.

输入

The input file will consist of several cases.
Each case will be presented by an integer n (1<=n<=100, and n is odd) at first. Following that, n positive integers will be given, one in a line. These numbers indicate the length of the sticks collected by Anthony.
The input is ended by n=0.

输出

For each case, output an integer in a line, which is the length of the last stick.

样例输入

3
1
2
1
0

样例输出

题目来源

第九届中山大学程序设计竞赛预选题

#include<iostream>
using namespace std;

int main(){
	int N,t,r;
	while(cin>>N && N){
		r = 0;
		while(N--){
			cin>>t;
			r ^= t;
		}
		cout<<r<<endl;
	}
}