zoukankan      html  css  js  c++  java
  • 765A Neverending competitions

    A. Neverending competitions
    time limit per test
    2 seconds
    memory limit per test
    512 megabytes
    input
    standard input
    output
    standard output

    There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name "snookah")! When a competition takes place somewhere far from their hometown, Ivan, Artsem and Konstantin take a flight to the contest and back.

    Jinotega's best friends, team Base have found a list of their itinerary receipts with information about departure and arrival airports. Now they wonder, where is Jinotega now: at home or at some competition far away? They know that:

    • this list contains all Jinotega's flights in this year (in arbitrary order),
    • Jinotega has only flown from his hometown to a snooker contest and back,
    • after each competition Jinotega flies back home (though they may attend a competition in one place several times),
    • and finally, at the beginning of the year Jinotega was at home.

    Please help them to determine Jinotega's location!

    Input

    In the first line of input there is a single integer n: the number of Jinotega's flights (1 ≤ n ≤ 100). In the second line there is a string of 3 capital Latin letters: the name of Jinotega's home airport. In the next n lines there is flight information, one flight per line, in form "XXX->YYY", where "XXX" is the name of departure airport "YYY" is the name of arrival airport. Exactly one of these airports is Jinotega's home airport.

    It is guaranteed that flights information is consistent with the knowledge of Jinotega's friends, which is described in the main part of the statement.

    Output

    If Jinotega is now at home, print "home" (without quotes), otherwise print "contest".

    Examples
    Input
    4
    SVO
    SVO->CDG
    LHR->SVO
    SVO->LHR
    CDG->SVO
    Output
    home
    Input
    3
    SVO
    SVO->HKT
    HKT->SVO
    SVO->RAP
    Output
    contest
    Note

    In the first sample Jinotega might first fly from SVO to CDG and back, and then from SVO to LHR and back, so now they should be at home. In the second sample Jinotega must now be at RAP because a flight from RAP back to SVO is not on the list.

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 
     5 using namespace std;
     6 
     7 int main()
     8 {
     9     int n, cnt1, cnt2;
    10     string src, line;
    11     while(cin>>n)
    12     {
    13         cnt1 = 0;
    14         cnt2 = 0;
    15         cin >> src;
    16         for(int i = 0; i < n; i++)
    17         {
    18             cin>>line;
    19             if(src[0] == line[0] && src[1] == line[1] && src[2] == line[2]) cnt1++;
    20             if(src[0] == line[5] && src[1] == line[6] && src[2] == line[7]) cnt2++;
    21         }
    22         if(cnt1==cnt2) cout<<"home"<<endl;
    23         else cout<<"contest"<<endl;
    24     }
    25     return 0;
    26 }
  • 相关阅读:
    _proto_和prototype的区别
    ajax
    图片预加载
    loading动画
    WinSCP
    检测竖屏 横屏
    webstrom hbuilder快捷键
    vue 引入sass
    npm install -save 和 -save-dev 区别
    打乱数组顺序
  • 原文地址:https://www.cnblogs.com/jxust-jiege666/p/6557066.html
Copyright © 2011-2022 走看看