HDU 2095 find your present (2)
来源:互联网 发布:在线制作淘宝店招 编辑:程序博客网 时间:2024/05/27 14:12
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24959 Accepted Submission(s): 9894
Total Submission(s): 24959 Accepted Submission(s): 9894
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这个题用一般套路很容易超时,所以这里用一个new方法,异或举一个例子。 如 数据 1 2 3 2 1 先让result=0 那么可以看成是 result^1^2^3^2^1 交换律 result^1^1^2^2^3 很明显 1^1 和 2^2 都为 0 所以最后得 result^3 =0^3 =3(二进制 101)怎样很容易理解吧#include<stdio.h>int main(){ int i,k,n,s; while(scanf("%d",&n),n) { s=0;for(i=0;i<n;i++){ scanf("%d",&k); s^=k;} printf("%d\n",s); }}
阅读全文
0 0
- 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)
- HDU 2095 find your present (2)
- Java常用类库知识要点总结
- RabbitMQ注解方式配置说明
- Unity 连接操作数据库
- Django blog
- Maven基础总结
- HDU 2095 find your present (2)
- python 元素移除
- 生活小记9
- 日期格式化
- 二维数组打印
- selemium页面常见问题的处理
- 安装python paramiko包
- VC unicode和多字节字符集模式下字符串相关函数调用技巧
- Java封装