pat-1041 Be Unique(20)（hash）-CSDN博客

本文链接：https://blog.csdn.net/hzyhfxt/article/details/82317891

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 17
Sample Output 1:
31
Sample Input 2:
5 888 666 666 888 888
Sample Output 2:
None
作者: CHEN, Yue

单位: 浙江大学

时间限制: 200 ms

内存限制: 64 MB

代码长度限制: 16 KB

之前用cin输入的，好几个测试点过不了。

这题不难，用一下hash完全没有问题吧...但是我就是有个测试点一直过不了...要是有人能指出我的错误那最好啦！

【18分的代码】

//#include <iostream>
//#include <algorithm>
//#include <cmath>
//#include <cstdlib>
//#include <cstring>
//#include <cstdio>
//#include <vector>
//using namespace std;
#include <stdio.h>
#include <string.h>
int a[100010],b[100010] ;

int main()
{
    memset(a,0,sizeof(a));
     memset(b,0,sizeof(b));
    int n,flag = 0;
    //cin>>n;
    scanf("%d",&n);
    for(int i = 0 ; i < n; i++)
    {
        scanf("%d",&b[i]);
        a[b[i]] ++;
    }
    for(int i = 0 ;i < 10005;i++)
    {
        if(a[b[i]] == 1)
        {
            printf("%d\n",b[i]);
            flag = 1;
            break;
        }
    }
    if(!flag)
        printf("None\n");
   
    return 0;
}