武汉科技大学计算机学院菜鸟杯:find your present (2).(杭电2095)
来源:互联网 发布:淘宝男装店铺推荐日系 编辑:程序博客网 时间:2024/04/28 15:04
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others)Total Submission(s): 11199 Accepted Submission(s): 4093
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 consist of several cases.
Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.
Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.
Output
For each case, output an integer in a line, which is the card number of your present.
Sample Input
51 1 3 2 231 2 10
Sample Output
32
代码如下:
/*抑或是一个很奇妙的运算符 a^a=0 这样出现偶数次的数抑或后就都没有了,只剩下唯一一个奇数次的了*/#include <stdio.h>int main(){ int a, n, b; while(scanf("%d", &n), n) { a = 0; while(n--) { scanf("%d", &b); a ^= b; } printf("%d\n", a); } return 0;}
- 武汉科技大学计算机学院菜鸟杯:find your present (2).(杭电2095)
- 武汉科技大学计算机学院菜鸟杯:Picture (杭电2052)
- 武汉科技大学计算机学院菜鸟杯:I Love This Game.(杭电2115)
- 武汉科技大学计算机学院菜鸟杯:人见人爱A+B.(杭电2033)
- 武汉科技大学计算机学院菜鸟杯:分拆素数和.(杭电2098)
- 武汉科技大学计算机学院菜鸟杯:手机短号.(杭电2081)
- 武汉科技大学计算机学院菜鸟杯:The sum problem (杭电2058)
- 武汉科技大学计算机学院菜鸟杯:Treasure the new start, freshmen! (杭电2061)
- 武汉科技大学计算机学院菜鸟杯:数塔 (杭电2084)
- 杭电2095 find your present (2)
- 杭电oj find your present (2)
- 杭电 acm find your present (2)
- 杭电2095(find your present (2))
- 杭电OJ-- 2095 find your present (依然很水)
- 杭电——find your present (2)
- Find your present!(杭电1563)
- 杭电1563 Find your present! java
- 杭电 1563 Find your present!
- Oracle之分组应用
- C#中的Type
- sharepoint 2010 如何根据权限控制Ribbon区域功能按钮的显示
- J-Link不能连接EFM32调试的问题
- Java编程中MySQL的中文UTF8问题
- 武汉科技大学计算机学院菜鸟杯:find your present (2).(杭电2095)
- 简单的CallByName
- public 、private、protected作用域
- Java 中文本组件MQDocument文档:采用正则表达式来判断输入是否合法
- Datalist使用存储过程来分页
- WLAN AP模块WizFi630—无线联网利器!
- .net在repeater里面自定义格式
- 小游戏系列算法之三连连看算法及原理
- hive reduce任务太多问题