zoukankan      html  css  js  c++  java
  • ZOJ 80ers' Memory

    80ers' Memory

    Time Limit: 1 Second      Memory Limit: 32768 KB

    I guess most of us are so called 80ers, which means that we were born in the 1980's. This group of people shared a lot of common memories. For example, the Saint Seiya, the YoYo ball, the Super Mario, and so on. Do you still remember these?

    Input

    There will be ONLY ONE test case.

    The test case begins with a positive integer N, (N < 100).
    Then there will be N lines each containing a single word describing a keyword of the typical 80ers' memories. Each word consists of letters, [a-zA-Z], numbers, [0-9], and the underline, '_'. The length of each word would be no more than 20.
    Then one line follows with a positive integer K, (K < 100).
    The last part of the test case will be K lines. The i-th line contains the keywords given by the i-th person and starts with a positive integer Ni. Then there will be Ni words separated by white spaces. Each of these words has no more than 20 characters.
    All the words are case sensitive.

    Output

    For each of these K people, you are asked to count the number of typical 80ers' keywords on his/her list and output it in a single line.

    Sample Input

    4
    Saint_Seiya
    YoYo_ball
    Super_Mario
    HuLuWa
    3
    2 Saint_Seiya TiaoFangZi
    1 KTV
    3 HuLuWa YOYO_BALL YoYo_ball
    

    Sample Output

    1
    0
    

    2

    #include <iostream>
    #include <stdlib.h>
    #include <stdio.h>
    #include <algorithm>
    #include <math.h>
    #include <string.h>
    #include <map>
    #include <string>
    
    using namespace std;
    int n,k,m;
    map<string,int> a;
    string b[105];
    int main()
    {
        scanf("%d",&n);
        string s;
        for(int i=1;i<=n;i++)
        {
            cin>>s;
            a[s]=1;
        }
        scanf("%d",&k);
        int ans=0;
        for(int i=1;i<=k;i++)
        {
            ans=0;
            scanf("%d",&m);
            for(int j=1;j<=m;j++)
            {
                cin>>s;
                if(a[s]!=0)
                    ans++;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }


  • 相关阅读:
    实验二、作业调度模拟实验
    实验一
    0909 初识操作系统
    实验四、主存空间的分配和回收模拟
    12.27评论5位同学试验三
    实验三进程调度模拟程序
    实验二、作业调度模拟实验
    实验一报告
    实验四 主存空间的分配和回收模拟
    实验三 进程调度模拟程序
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228561.html
Copyright © 2011-2022 走看看