zoukankan      html  css  js  c++  java
  • 1041. Be Unique (20)

    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
    #include<cstdio>
    int a[100010],hashTable[100010] = {0};
    int main(){
        int n;
        scanf("%d",&n);
        int i,k;
        for(i = 0; i < n; i++){
            scanf("%d",&a[i]);        
            hashTable[a[i]]++;
        }
        int ans = -1;
        for(i = 0; i < n; i++){
            if(hashTable[a[i]] == 1){
                
                ans = a[i];
                break;
            }
        } 
        if(ans == -1) printf("None");
        else printf("%d",ans);
        return 0;
    }
  • 相关阅读:
    Android 禁止软键盘自动弹出
    Android之Adapter用法总结
    如何成为android高手
    最强大的文案策略
    外贸电商的ERP有很多
    ERP行业销售如何挖掘潜在客户?
    新制造
    C#实现字符串相似度算法
    cmd
    对于大型公司项目平台选择j2ee的几层认识
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/8646691.html
Copyright © 2011-2022 走看看