原题链接:1039 Course List for Student
#include<algorithm>
#include<iostream>
#include<cstdio>
#include <vector>
using namespace std;
const int MAX_M = 26*26*26*10;//学生姓名散列后的最大容量
vector<int> SelectCourse[MAX_M];//存放每个学生所选择的课程的id号
int getID(char name[])//把学生姓名散列为其ID
{
int ID = 0;
for(int i=0; i<3; i++)
{
ID = ID*26 + (name[i] - 'A');
}
ID = ID*10 + (name[3] - '0');
return ID;
}
int main()
{
int N, K;
scanf("%d %d", &N, &K);
for(int i=0, j; i<K; i++)
{
int course_id, stu_num;
char stu_name[5];
scanf("%d %d", &course_id, &stu_num);
for(j=0; j<stu_num; j++)
{
scanf("%s", stu_name);
SelectCourse[getID(stu_name)].push_back(course_id);//存放
}
}
for(int i=0, j; i<N; i++)
{
char stu_name[5];
scanf("%s", stu_name);
int stu_id = getID(stu_name);
printf("%s %d", stu_name, SelectCourse[stu_id].size());//先输出名字和所选课程总数
sort(SelectCourse[stu_id].begin(), SelectCourse[stu_id].end());//排序
for(j=0; j<SelectCourse[stu_id].size(); j++)
{
printf(" %d", SelectCourse[stu_id][j]);//再输出课程号
}
printf("\n");
}
return 0;
}