zoukankan      html  css  js  c++  java
  • 1047 Student List for Course (25 分)

    1047 Student List for Course (25 分)
     

    Zhejiang University has 40,000 students and provides 2,500 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 (≤), the total number of students, and K (≤), 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 (≤) 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 5
    ZOE1 2 4 5
    ANN0 3 5 2 1
    BOB5 5 3 4 2 1 5
    JOE4 1 2
    JAY9 4 1 2 5 4
    FRA8 3 4 2 5
    DON2 2 4 5
    AMY7 1 5
    KAT3 3 5 4 2
    LOR6 4 2 4 1 5
    

    Sample Output:

    1 4
    ANN0
    BOB5
    JAY9
    LOR6
    2 7
    ANN0
    BOB5
    FRA8
    JAY9
    JOE4
    KAT3
    LOR6
    3 1
    BOB5
    4 7
    BOB5
    DON2
    FRA8
    JAY9
    KAT3
    LOR6
    ZOE1
    5 9
    AMY7
    ANN0
    BOB5
    DON2
    FRA8
    JAY9
    KAT3
    LOR6
    ZOE1

    标记存储,卡cin
    所以要用scanf
     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 int n,p,m,k;
     5 vector<string> v[2505];
     6 
     7 int main(){
     8     scanf("%d%d", &n, &p);
     9     char s[100];
    10     for(int i = 0; i < n; i++){
    11         scanf("%s%d", s, &m);
    12         for(int j = 0 ; j < m; j++ ){
    13             cin >> k;
    14             v[k].push_back(s);
    15         }
    16     }
    17     for(int i = 1; i <= p; i++){
    18         sort(v[i].begin(), v[i].end());
    19         printf("%d %d
    ",i, v[i].size());
    20         for(int j = 0; j < v[i].size(); j++){
    21             printf("%s
    ", v[i][j].c_str());
    22         }
    23     }
    24     return 0;
    25 }


  • 相关阅读:
    k-近邻算法
    配置nginx 高并发 php
    ubuntu上安装mysql 编译安装
    Webpack探索【1】--- 基础知识
    【JavaScript专题】--- 立即执行函数表达式
    Eslint使用指南
    Maven学习笔记【2】 -- 安装和配置
    Maven学习笔记【1】 -- Maven简介
    Git中如何将代码恢复到之前某个节点
    密码硬编码(Password Management: Hardcoded Password)
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/11185131.html
Copyright © 2011-2022 走看看