hdu2095 find your present (2)（C语言

最新推荐文章于 2018-02-07 13:16:08 发布

水牛不喝水

最新推荐文章于 2018-02-07 13:16:08 发布

阅读量482

点赞数

分类专栏：算法训练01-大学训练文章标签： ACM hdu c语言

本文链接：https://blog.csdn.net/sinat_39591298/article/details/76408575

版权

这是一篇关于ACM竞赛的问题，你需要找出一个堆礼物中唯一不同的卡片编号。输入包含若干测试用例，每个用例由一个奇数n和n个正整数组成，表示礼物上的卡片编号。你的任务是输出那个出现奇数次的卡片编号。示例输入给出了两个测试用例，分别给出了正确答案。提示使用scanf避免超时，给出的C语言代码利用位操作找到答案。

摘要由CSDN通过智能技术生成

Problem Description

In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others, and you can assume that only one number appear odd times.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.

Input

The input file will consi