P5886 Hello, 2020! 洛谷

题目链接：https://www.luogu.com.cn/problem/P5886

思路：

        暴力统计号码出现的次数，若出现次数与正确预测数相同，那么位选手可能为第一名

代码如下

#include <stdio.h>
#include <stdlib.h>

int main ( )
{
    int n, m, p, k, x, sum = 0;
    int ans[ 1000004 ] = { 0 };

    scanf ( "%d %d %d", &n, &m, &p );

    while ( n -- )
    {
        scanf ( "%d", &k );
        while ( k -- )
        {
            scanf ( "%d", &x );
            ++ ans[ x ];
        }
    }

    for ( x = 1; x <= m; ++ x )
    {
        if ( ans[ x ] == p )
        {
            ++ sum;
        }
    }

    printf ( "%d\n", sum );

    x = 1;
    while ( sum )
    {
        if ( ans[ x ] == p )
        {
            printf ( "%d ", x );
            -- sum;
        }
        ++ x;
    }

    system ( "pause" );

    return 0;
}