PAT_1041: Be Unique
来源:互联网 发布:csol三米优化刀 编辑:程序博客网 时间:2024/04/30 01:53
Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 104]. The first one who bets on a unique number wins. For example, if there are 7 people betting on 5 31 5 88 67 88 17, then the second one who bets on 31 wins.
Input Specification:
Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=105) and then followed by N bets. The numbers are separated by a space.
Output Specification:
For each test case, print the winning number in a line. If there is no winner, print "None" instead.
Sample Input 1:7 5 31 5 88 67 88 17Sample Output 1:
31Sample Input 2:
5 888 666 666 888 888Sample Output 2:
None
备注:这题太坑了!算法无误(用hash的思想)。刚开始用cin,cout输入输出就超时!改成scanf,printf就A了。我是不是又无知了?
#include<string.h>#include<stdio.h>#define MAXSIZE 100000#define MAXCOUNT 10000int main(){int n,a[MAXSIZE],i;int count[MAXCOUNT];scanf("%d",&n);memset(count,0,MAXCOUNT);for(i=0;i<n;i++){scanf("%d",&a[i]);count[a[i]]++;}for(i=0;i<n;i++){if(count[a[i]]==1){printf("%d",a[i]);return 0;}}printf("None");return 0;}
- PAT_1041: Be Unique
- PAT_1041. Be Unique
- pat_1041
- Be Unique
- 1041. Be Unique
- pat 1041 Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- [哈希]PAT1041 Be Unique
- PAT 1041. Be Unique
- PAT 1041. Be Unique
- 1041. Be Unique
- 1041. Be Unique
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- Oracle Memory Architecture - Oracle 体系结构篇 5
- 简介
- 用true/false短路语句的方式不适用于带join的语句
- 路径参数函数:路径的获取(GetModuleFileName)和拆分(_splitpath)
- Android 使用多个Intent 进行activity跳转 而没有finish的情况,如何直接退出系统
- PAT_1041: Be Unique
- common-io之Comparator阅读
- javascript检查表单数据是否改变
- PKU 2886 反素数+线段树
- Exception when run load test use visual studio.
- PHP中set_time_limit
- 智慧可以求生
- 挂起一个进程
- sqlserver是用触发器来实现 insert 后 返回自增 行的id号