1041 Be Unique

1041 Be Unique

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

重点是要求只输出“第一个”唯一的数字

#include<cstdio>

int num[100010] = { 0 };
int count[100010] = { 0 };

int main()
{
  int count1;
  scanf_s("%d", &count1);
  for (int i = 0; i < count1; i++)
  {
    scanf_s("%d", &num[i]);
    count[num[i]]++;
  }
  int i;
  for (i = 0; i < count1; i++)
  {
    if (count[num[i]] == 1)
    {
      printf("%d\n", num[i]);
      break;
    }
  }
  if (i == count1)
  {
    printf("None\n");
  }
}