hdu 2095 find your present (2)
来源:互联网 发布:西安电子大学网络教育 编辑:程序博客网 时间:2024/06/07 03:23
#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)
- cartographer源码分析(43)-kalman_filterunscented_kalman_filter.h
- 浮动与清除浮动
- Hdu 5876 Sparse Graph bfs 变型最短路
- hdu 2092 整数解
- cartographer源码分析(44)-kalman_filter-pose_tracker.h
- hdu 2095 find your present (2)
- Linux系统调用
- 堆排序
- DPDK之环境抽象层(1)
- 使用kotlin<一>
- of 的用法
- 头结点循环链表
- C语言实现单链表
- hdu 2097 Sky数