zoukankan      html  css  js  c++  java
  • CodeForces765A

    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 3capital 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 //2017-02-14
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 
     6 using namespace std;
     7 
     8 int main()
     9 {
    10     int n, cnt1, cnt2;
    11     string src, line;
    12     while(cin>>n)
    13     {
    14         cnt1 = 0;
    15         cnt2 = 0;
    16         cin >> src;
    17         for(int i = 0; i < n; i++)
    18         {
    19             cin>>line;
    20             if(src[0]==line[0]&&src[1]==line[1]&&src[2]==line[2])cnt1++;
    21             if(src[0]==line[5]&&src[1]==line[6]&&src[2]==line[7])cnt2++;
    22         }
    23         if(cnt1==cnt2)cout<<"home"<<endl;
    24         else cout<<"contest"<<endl;
    25     }
    26 
    27     return 0;
    28 }
  • 相关阅读:
    Linux/UNIX线程(1)
    jeecms 链接标签
    JEECMS 系统权限设计
    jeecms 前台拦截器的研究与改造
    jeecms系统_自定义对象流程
    jeecms技术预研
    jeecms获取绝对路径
    JEECMS自定义标签
    jeecms项目相关配置文件
    [jeecms]获取父栏目下的子栏目名称
  • 原文地址:https://www.cnblogs.com/Penn000/p/6399371.html
Copyright © 2011-2022 走看看