1047. Student List for Course (25)
来源:互联网 发布:java excel 合并 编辑:程序博客网 时间:2024/06/08 00:14
Zhejiang University has 40000 students and provides 2500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 numbers: N (<=40000), the total number of students, and K (<=2500), the total number of courses. Then N lines follow, each contains a student’s name (3 capital English letters plus a one-digit number), a positive number C (<=20) which is the number of courses that this student has registered, and then followed by C course numbers. For the sake of simplicity, the courses are numbered from 1 to K.
Output Specification:
For each test case, print the student name lists of all the courses in increasing order of the course numbers. For each course, first print in one line the course number and the number of registered students, separated by a space. Then output the students’ names in alphabetical order. Each name occupies a line.
Sample Input:10 5ZOE1 2 4 5ANN0 3 5 2 1BOB5 5 3 4 2 1 5JOE4 1 2JAY9 4 1 2 5 4FRA8 3 4 2 5DON2 2 4 5AMY7 1 5KAT3 3 5 4 2LOR6 4 2 4 1 5Sample Output:
1 4ANN0BOB5JAY9LOR62 7ANN0BOB5FRA8JAY9JOE4KAT3LOR63 1BOB54 7BOB5DON2FRA8JAY9KAT3LOR6ZOE15 9AMY7ANN0BOB5DON2FRA8JAY9KAT3LOR6ZOE1
#include<iostream>#include<vector>#include<algorithm>#include<cstdio>using namespace std;vector <int > v[2505];int n,m,k,course;int toint(char s[]){ int sum=0; for(int i=0;i<3;i++) sum=sum*26+s[i]-'A'; sum=sum*10+s[3]-'0'; return sum;}void tochar (int num){ char str[4]; str[3]=num%10+'0',num/=10; str[2]=num%26+'A',num/=26; str[1]=num%26+'A',num/=26; str[0]=num%26+'A',num/=26; printf("%c%c%c%c\n",str[0],str[1],str[2],str[3]);}int main(){ char name[5]; scanf("%d %d",&n,&m); for (int i=0;i<n;i++) { scanf("%s",name); int na=toint(name); scanf("%d",&k); for (int j=0;j<k;j++) { scanf("%d",&course); v[course].push_back(na); } } for (int i=1;i<=m;i++) { printf("%d %d\n",i,v[i].size()); sort(v[i].begin(),v[i].end()); for (int j=0;j<v[i].size();j++) tochar(v[i][j]); } return 0;}
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)-PAT
- 1047. Student List for Course (25)
- 【PAT】1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- PAT 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 1047. Student List for Course (25)
- 看图理解HBase
- 从emacs安装理解windows的PATH
- tcp四次挥手中LAST_ACK状态一般持续多久?
- STM32F103mini基础知识归纳
- 线程间通讯的机制——Hanlder
- 1047. Student List for Course (25)
- 《数据结构(C语言版)》- 队列
- sql语句
- 文件权限篇(二)
- WIFI 考勤打卡 浅析
- [bzoj3994]约数个数和
- gridview xian
- 判断大小端模式与共用体
- golang json解析出现值为空