zoukankan      html  css  js  c++  java
  • Ignatius and the Princess IV(乱搞一发竟然过了)

    B - Ignatius and the Princess IV
    Time Limit:1000MS     Memory Limit:32767KB     64bit IO Format:%I64d & %I64u
    Submit Status

    Description

    "OK, you are not too bad, em... But you can never pass the next test." feng5166 says. 

    "I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says. 

    "But what is the characteristic of the special integer?" Ignatius asks. 

    "The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says. 

    Can you find the special integer for Ignatius? 
     

    Input

    The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is terminated by the end of file. 
     

    Output

    For each test case, you have to output only one line which contains the special number you have found. 
     

    Sample Input

    5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1
     

    Sample Output

    3 5 1
     
    /*
    题意:给你奇数个数,然后让你找出一个数,这个数在里面至少出现过(n+1)/2次
    
    初步思路:感觉可以暴力搞一下
    */
    #include <bits/stdc++.h>
    using namespace std;
    int n;
    int a;
    int vis[1000005];
    void init(){
        memset(vis,0,sizeof vis);
    }
    int main(){
        // freopen("in.txt","r",stdin);
        while(scanf("%d",&n)!=EOF){
            init();
            int res=0;
            for(int i=0;i<n;i++){
                scanf("%d",&a);
                vis[a]++;
                if(vis[a]>=(n+1)/2)
                    res=a;
            }
            printf("%d
    ",res);
        }
        return 0;
    }
  • 相关阅读:
    python学习笔记-4-列表和元组
    迭代器 生成器, 可迭代对象以及应用场景
    mysql的创创建用户阶段 开启客户端登录和授权阶段
    初识mysql数据库
    拆目录
    日志编码
    数据库mysql的安装.启动和基础配置------windows版本
    协程
    线程锁 死锁现象 递归锁 信号量 条件定时器 队列 线程池
    网络线程
  • 原文地址:https://www.cnblogs.com/wuwangchuxin0924/p/6547956.html
Copyright © 2011-2022 走看看