HDU 2095 find your present (2)(简单题目)
来源:互联网 发布:虚拟机mac安装xcode 编辑:程序博客网 时间:2024/05/21 17:20
本题是一个简单题目,就是找出一个只有一个的数字。。
很简单,就不说别的了,,直接附上AC代码,。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[1000005];int main(){ int n; while(~scanf("%d",&n)) { if(n==0)break; for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); for(int i=0;i<n;i+=2) { if(a[i]!=a[i+1]) { printf("%d\n",a[i]); break; } } } return 0;}
0 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 AOP预处理Controller的参数
- C语言内存对齐
- swift中try的使用和throws错误的抛出解决
- Socket描述符选项
- PL/SQL基本使用
- HDU 2095 find your present (2)(简单题目)
- ubuntu永久修改主机名
- Java中的流与文件:正则表达式
- codeforces--651A Joysticks(贪心)
- 数列特征(找最大值、最小值、和)
- Python基础--不可变序列:元组
- jackson 使用
- MySQL的常用语法
- Android项目结构分析