PAT 1041. Be Unique (20)
2015-03-14 11:36
330 查看
//1041 #include<stdio.h> int main() { int n; int i; int a; int num[100008]; int flag[10008]; int j; int k = 0; int tag = 0; scanf("%d",&n); for(i=0;i<=1000;i++) { flag[i] = 0; } for(i=0;i<n;i++) { scanf("%d",&num[i]); flag[num[i]]++; } for(i=0;i<n;i++) { if(flag[num[i]]==1) { printf("%d",num[i]); break; } } if(i==n) printf("None"); return 0; }
相关文章推荐
- pat 1041. Be Unique (20)
- PAT(甲级)1041. Be Unique (20)
- Python实现Pat 1041. Be Unique (20)
- PAT-A 1041. Be Unique (20)
- 【PAT】1041. Be Unique (20)
- PAT 1041. Be Unique (20)(判断第一个不重复出现的数字是哪个)
- PAT (Advanced Level) 1041. Be Unique (20)
- 【PAT】【Advanced Level】1041. Be Unique (20)
- 【c++】PAT (Advanced Level)1041. Be Unique (20)
- PAT 甲级 1041. Be Unique (20) 【STL】
- 1041. Be Unique (20)-PAT甲级真题(Hash散列)
- PAT_A 1041. Be Unique (20)
- PAT-A-1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- 【PAT甲级】1041. Be Unique (20)
- PAT甲级1041. Be Unique (20)
- PAT 1041. Be Unique (20)
- PAT - 甲级 - 1041. Be Unique (20)(Hash散列)
- PAT 1041. Be Unique (20) 【Hash思想】
- 浙江大学PAT_甲级_1041. Be Unique (20)