hdu 2095 find your present (2)
来源:互联网 发布:草东没有派对知乎 编辑:程序博客网 时间:2024/05/16 10:22
#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); } return 0;}
阅读全文
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)
- hdu 2092 整数解
- ruby06
- 简单的谈几个经常抱团出现的家伙,Redis/Memcache/MongoDb
- Java<<、>>与>>>移位操作(二)
- 1110. Complete Binary Tree (25) <完全二叉树>
- hdu 2095 find your present (2)
- swift纯代码UITabBarController的使用
- M
- day04
- VBA 中的UBound
- 八大排序算法之-冒泡排序 java代码
- Tempter of the Bone(树的直径)
- 数据结构栈之进制转换
- 浏览器兼容