PAT甲1039 Course List for Student (25)（25 分）

#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <iostream>
#include <vector>
using namespace std;

const int maxn=26*26*26*10;

vector<int> course[maxn];

int geti(char a[])
{
    int index=0;
    index=26*26*10*(a[0]-'A')+26*10*(a[1]-'A')+10*(a[2]-'A')+a[3]-'0';
    return index;
}

int N,M,k,n;

int main()
{
    scanf("%d%d",&N,&M);
    char name[5];
    for(int i=0;i<M;i++)
    {
        scanf("%d%d",&k,&n);
        for(int j=0;j<n;j++)
        {
            scanf("%s",&name);
            int index=geti(name);
            course[index].push_back(k);
        }
    }
    for(int i=0;i<N;i++)
    {
        scanf("%s",&name);
        int index=geti(name);
        printf("%s %d",name,course[index].size());
        if(course[index].size()>0)
        {
            sort(course[index].begin(),course[index].end());
            for(int j=0;j<course[index].size();j++)
            {
                printf(" %d",course[index][j]);
            }
        }
        printf("\n");
    }
    return 0;
}