1041. Be Unique (20)

原创 2015年07月10日 14:19:11

题目如下:

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

题目要求找出一个序列中第一个在序列中只出现了一次的数,实现方法很简单,使用map记录每个数出现的次数,然后使用vector记录输入顺序,依次判断即可。

#include <iostream>
#include <map>
#include <vector>
#include <stdio.h>

using namespace std;

int main()
{
    map<int,int> numMap;
    vector<int> nums;
    int N;
    cin >> N;
    int num;
    for(int i = 0; i < N; i++){
        scanf("%d",&num);
        numMap[num]++;
        nums.push_back(num);
    }
    num = - 1;
    for(int i = 0; i < nums.size(); i++){
        if(numMap[nums[i]] == 1){
            num = nums[i];
            break;
        }
    }
    if(num == -1) cout << "None" << endl;
    else cout << num << endl;

    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

1041. Be Unique (20)

点击打开链接 #include #define MAX 100010 int hash[MAX]={0}; int a[MAX]; int main(){ freopen("in.txt","r...

1041. Be Unique (20)

Being unique is so important to people on Mars that even their lottery is designed in a unique way. ...

1041. Be Unique (20)

考察查询表 #include #include typedef struct lottery { int cnt; int index; lottery(int _cnt = 0, int ...

1041. Be Unique (20)

Being unique is so important to people on Mars that even their lottery is designed in a unique way. ...

1041. Be Unique (20)

题目链接:http://www.patest.cn/contests/pat-a-practise/1041 题目: 1041. Be Unique (20) 时间限制 ...

PAT-A 1041. Be Unique (20)

按照输入次序输出最早输入的那个唯一的数

浙江大学PAT_甲级_1041. Be Unique (20)

C++ map

toms outlet sweep her to look at me in the street would be worried. "20

from Sichuan,toms outlet, follow their parents to Fuzhou. Because the home was in fifth grade to tea...

mpegtool1041

  • 2011-03-16 17:41
  • 1.51MB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)