fzu 1001 Duplicate Pair
2015-08-08 11:49
239 查看
[code]#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[1000000+5]; int main() { int n,i,t,ans; while(~scanf("%d",&n)) { memset(a,0,sizeof(a)); for(i=0;i<n;i++) { scanf("%d",&t); a[t]++; if(a[t]==2) ans=t; } printf("%d\n",ans); } return 0; }
相关文章推荐
- fzu 1001 Duplicate Pair
- Thai language
- [CareerCup] 4.8 Contain Tree 包含树
- scala学习之:trait的理解
- 算法杂货铺——分类算法之朴素贝叶斯分类(Naive Bayesian classification)
- Duplicate Emails
- hdu 5306 Hiking || 2015 Multi-University Training Contest 6 (优先队列 为小疯子而生)
- U盘无法启动 Ubuntu 的解决方法——基于 UltraISO
- [LeetCode]217-Contains Duplicate 几种解法
- 2015 Multi-University Training Contest 6 Solutions
- POJ 1273 && HDU 1532 Drainage Ditches(最大流-Dinic)
- ORA-09925: Unable to create audit trail file
- Google Container Engine笔记
- 2015 Multi-University Training Contest 6_1008_Hiking(贪心)
- HDOJ-1788 Chinese remainder theorem again(数论)
- 杭电ACM1302——The Snail
- A. Lineland Mail
- 2015 HUAS Summer Trainning #4 A
- 九个衡量 Rails 应用性能的小方法
- 九个衡量 Rails 应用性能的小方法