PAT 1041. Be Unique (20)

http://www.patest.cn/contests/pat-a-practise/1041

 1 #include<stdio.h>
 2 #include<string.h>
 3 int num[11000];
 4 int bet_num[100000 + 5];
 5 
 6 int main() {
 7     int n;
 8     memset(num, 0, sizeof(num));
 9     scanf("%d", &n);
10     for (int i = 0; i < n; ++i) {
11         scanf("%d", &bet_num[i]);
12         num[bet_num[i]]++;
13     }
14     for (int i = 0; i < n; ++i) {
15         if (num[bet_num[i]] == 1) {
16             printf("%d\n", bet_num[i]);
17             return 0;
18         }
19     }
20     puts("None");
21     return 0;
22 }

 

posted @ 2015-08-03 17:53  ACSeed  Views(112)  Comments(0)    收藏  举报