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, 10⁴]. 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 (<=10⁵) 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 <stdio.h>
 int lottery(int *,int);
 int main(void)
 {
      //freopen("in.txt","r",stdin);
      int n;
      int num[];
      int i;

      scanf("%d",&n);
      for(i=;i<n;i++)
      {
           scanf("%d",&num[i]);
      }
      lottery(num,n);
      return ;
 }
 int lottery (int *num,int n)
 {
      int i,j;
      int flag;
      int count[]={};

      for(i=;i<n;i++)
      {
           count[num[i]]++;
      }

      for(i=;i<n;i++)
      {
           if(count[num[i]]==)
                {
                     printf("%d\n",num[i]);
                     return ;
                }
      }

      printf("None\n");
      return ;
 }