zoukankan      html  css  js  c++  java
  • POJ 2092 Grandpa is Famous

    Grandpa is Famous
    Time Limit: 2000MS   Memory Limit: 30000K
    Total Submissions: 7153   Accepted: 3624

    Description

    The whole family was excited by the news. Everyone knew grandpa had been an extremely good bridge player for decades, but when it was announced he would be in the Guinness Book of World Records as the most successful bridge player ever, whow, that was astonishing! 
    The International Bridge Association (IBA) has maintained, for several years, a weekly ranking of the best players in the world. Considering that each appearance in a weekly ranking constitutes a point for the player, grandpa was nominated the best player ever because he got the highest number of points. 
    Having many friends who were also competing against him, grandpa is extremely curious to know which player(s) took the second place. Since the IBA rankings are now available in the internet he turned to you for help. He needs a program which, when given a list of weekly rankings, finds out which player(s) got the second place according to the number of points.

    Input

    The input contains several test cases. Players are identified by integers from 1 to 10000. The first line of a test case contains two integers N and M indicating respectively the number of rankings available (2 <= N <= 500) and the number of players in each ranking (2 <= M <= 500). Each of the next N lines contains the description of one weekly ranking. Each description is composed by a sequence of M integers, separated by a blank space, identifying the players who figured in that weekly ranking. You can assume that: 
    • in each test case there is exactly one best player and at least one second best player, 
    • each weekly ranking consists of M distinct player identifiers.

    The end of input is indicated by N = M = 0.

    Output

    For each test case in the input your program must produce one line of output, containing the identification number of the player who is second best in number of appearances in the rankings. If there is a tie for second best, print the identification numbers of all second best players in increasing order. Each identification number produced must be followed by a blank space.

    Sample Input

    4 5
    20 33 25 32 99
    32 86 99 25 10
    20 99 10 33 86
    19 33 74 99 32
    3 6
    2 34 67 36 79 93
    100 38 21 76 91 85
    32 23 85 31 88 1
    0 0

    Sample Output

    32 33
    1 2 21 23 31 32 34 36 38 67 76 79 88 91 93 100
    题目大意:求出现次数第二多的数。
    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    using namespace std;
    
    int nCount[10005];
    
    int main()
    {
        int m, n;
        int a;
        while(scanf("%d%d", &m, &n) != EOF)
        {
            if (m == 0 && n == 0)
            {
                break;
            }
            int index = 0;
            memset(nCount , 0, sizeof(nCount));
            for(int i = 0; i < m; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    scanf("%d", &a);
                    nCount[a]++;
                }
            }
            int max1 = -1, max2 = -1;
            for (int i = 1; i <= 10000; i++)
            {
                if (nCount[i] > max1)
                {
                    max2 = max1;
                    max1 = nCount[i];
                }
                else
                {
                    if (nCount[i] > max2)
                    {
                        max2 = nCount[i];
                    }
                }
            }
            int nsum = 0;
            for (int i = 1; i <= 10000; i++)
            {
                if (nCount[i] == max2)
                {
                    if (nsum != 0)
                    {
                        printf(" %d", i);
                    }
                    else
                    {
                        nsum++;
                        printf("%d", i);
                    }
                }
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    [dll注入实现IAT勾取] 计算器显示中文
    [记事本API Hook] 调试器 勾取 WriteFile()Api
    [DLL注入的方法]进程创建期修改PE输入表法
    [DLL注入的方法]静态修改PE输入表法
    [1]编程实现加载驱动
    [保护模式]测试一致代码段
    [保护模式]联系1 三环访问高2G
    15.[保护模式]TSS任务门
    ERP中HR模块的操作与设计--开源软件诞生26
    ERP的主数据的操作与设计--开源软件诞生25
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3189653.html
Copyright © 2011-2022 走看看