bupt 84 Single Number(水题)
来源:互联网 发布:java网络编程 pdf 编辑:程序博客网 时间:2024/04/30 13:50
思路:排个序然后扫一遍即可
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;#define LL long longconst int maxn = 100000+100;LL a[maxn];int main(){int n;while(scanf("%d",&n)!=EOF){ for(int i = 1;i<=n;i++) scanf("%lld",&a[i]); sort(a+1,a+1+n); for(int i = 1;i<=n;i+=3) { if(a[i]==a[i+1]&&a[i+1]==a[i+2]) continue; else { printf("%lld\n",a[i]); break; } }}}
时间限制 1000 ms 内存限制 65536 KB
题目描述
Given an array with
输入格式
Several test cases are given, terminated by EOF.
Each test case consists of two lines. The first line gives the length of array
输出格式
Output the answer for each test case, one per line.
输入样例
41 1 1 3101 2 3 1 2 3 1 2 3 4
输出样例
34
0 0
- bupt 84 Single Number(水题)
- 好题 BUPT OJ84 SINGLE NUMBER
- #84 Single Number III
- Single Number(c++)
- BUPT OJ210 Rist-Number
- Leetcode: Single Number III (Single Number扩展)
- 北邮oj 84 single number
- Single Number II (java)
- LeetCode(136) Single Number
- 136. Single Number(C++)
- BUPT OJ178 lili‘s number
- Single Number
- single number
- Single Number
- Single Number
- Single Number
- Single Number
- Single Number
- linux 代码编程风格
- html 获取图片的宽和高
- leetcode #77 in cpp
- linux下文件描述符的介绍
- 删除Xcode中多余的证书provisioning profile
- bupt 84 Single Number(水题)
- 怎样安全的退出Activity和Application
- 俞敏洪老师的话
- AJAX提交数据再firefox中报out of memory
- 样条关键帧动画(SplineDoubleKeyFrame)
- 关于导很多jar包和类库之后出现的问题
- 物流云管理系统-免费版
- 深究Oracle的隔离级别
- tomcat 中文问题