zoukankan      html  css  js  c++  java
  • SDNU 1536.How many users on SDNU OJ(水题)

    Description

    There are many users on SDNU OJ, but only the one who registered can use it. We think different username represent different user.

    One day ZhouXiaohui got a record of "Status Pages", the captain Albert_s wants to know how many users are using SDNU OJ at that time.

    He will give you an "Accepted" as a gift if you help him figure out this problem.

    Input

    The first line of the input contains an integer T, denoting the number of "Status Pages" ZhouXiaohui got.
    In each "Status Pages", there is a single integers n in one line, denoting all the username on this pages, then following username .
    , ,

    Output

    For each testcase, print a single line starting with "Case #i:"(i indicates the case number) and then a single integer, denoting the answer Albert_s wants to know, separated with a single space.

    Sample Input

    1
    3
    ZhouXiaohui
    ZhouLaohui
    ZhouXiaohui

    Sample Output

    Case #1: 2

    Source

    Unknown
    #include <cstdio>
    #include <iostream>
    #include <string>
    #include <cstring>
    #include <cmath>
    #include <algorithm>
    #include <queue>
    #include <vector>
    #include <map>
    using namespace std;
    #define ll long long
    
    int t, n, sum;
    string name[100000+8];
    
    int main()
    {
        scanf("%d", &t);
        int miao = t;
        while(t--)
        {
            bool flag = 0;
            int num = 0;
            cin>>n;
            for(int i = 0; i<n; i++)
            {
                flag = 0;
                cin>>name[i];
                for(int j = 0; j<i; j++)
                {
                    if(name[i] == name[j])
                    {
                        flag = 1;
                        break;
                    }
                }
                if(flag)continue;
                else num++;
            }
            printf("Case #%d: %d
    ", miao-t, num);
        }
        return 0;
    }
  • 相关阅读:
    hdu 4332 Constructing Chimney 夜
    poj 2449 Remmarguts' Date 夜
    poj 2728 Desert King 夜
    poj 1639 Picnic Planning 夜
    poj 1125 Stockbroker Grapevine 夜
    poj 3621 Sightseeing Cows 夜
    hdu 4333 Revolving Digits 夜
    hdu 4345 Permutation 夜
    hdu 1874 通畅工程续 夜
    es6(二)
  • 原文地址:https://www.cnblogs.com/RootVount/p/11218141.html
Copyright © 2011-2022 走看看