zoukankan      html  css  js  c++  java
  • 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, 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

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int main(){
    	int n;
    	int num[10002];
    	int a[100002];
    	memset(num,0,sizeof(num));
    	int i;
    	scanf("%d",&n);
    	for(i=0;i<n;i++){
    		scanf("%d",&a[i]);
    		num[a[i]]++;
    	}
    	int flag=0;
    	for(i=0;i<n;i++){
    		if(num[a[i]]==1){
    			printf("%d
    ",a[i]);
    			flag=1;
    			break;
    		}
    	}
    	if(flag==0){
    		printf("None
    ");
    	}
    	return 0;
    } 
    

      

  • 相关阅读:
    python爬虫
    绕过CDN查找网站真实IP方法收集
    拖库
    伪静态注入的总结
    国外安全网站信息收集
    python字典去重脚本
    AOP 的利器:ASM 3.0 介绍
    JDK工具
    JVM性能调优监控工具
    DMZ
  • 原文地址:https://www.cnblogs.com/grglym/p/7718753.html
Copyright © 2011-2022 走看看