HDU 2095 find your present (2) (水)
来源:互联网 发布:java web课程设计 编辑:程序博客网 时间:2024/05/14 13:09
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others)
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
32use scanf to avoid Time Limit ExceededHintHint
#include <stdio.h>int main(){ int n,i,tmp,ans; while(scanf("%d",&n),n){ ans=0; for(i=1;i<=n;i++){ scanf("%d",&tmp); ans^=tmp; } printf("%d\n",ans); } return 0;}
- hdu 2095 find your present(2)
- hdu-2095-find your present (2)//1563-find your present
- HDU 2095 find your present (2) (水)
- HDU 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095--Find your present (2) 【set】
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- spring mvc的controller国际化
- 获取数据库服务器时间
- HOOK ntfs 禁止格式化
- MyEclipse 配置SVN插件
- AODV中路由表及控制消息结构(包含aodv开源代码)
- HDU 2095 find your present (2) (水)
- Ubuntu12.04下手动配置安装apache+php+mysql
- IBATIS#和$的区别
- MySql服务无法启动系统出错发生系统错误1067进程意外终止
- LION磁盘工具恢复系统安装盘时‘无法恢复-资源忙’问题的方法
- SLF4J 的几种实际应用模式--之一:SLF4J+Log4J(转载)
- HDU 2104 hide handkerchief (水)
- THS5651A
- Excel 2010出现there was a problem sending the command to the program解决