10063_TravelGames

2022-5-16 18:16| 发布者: Hocassian| 查看: 95| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-3-89504508056900-Problem List-采集的数据-后羿采集器.html

Pro.ID

10063

Title

Travel Games

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=10063

AC

3

Submit

6

Ratio

50.00%

时间&空间限制

  • Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)
  • 描述

    The cows are taking a trip to the lakes in Minnesota. Like everyone else, they are bored and are playing "travel games" to pass the time away.

    In this travel game, the first cow thinks of a three letter word from the Sacred Travel Game Dictionary (STGD). The next cow in line must add a letter to the word (at the beginning, between two letters, or at the end) to make another word in the STGD. The cows are curious as to just how big the final word can be.

    Given a dictionary of D (1 ≤ D ≤ 1000) words and a starting word, find any of the longest possible words that can be formed playing this travel game.

    输入

    * Line 1:   The integer D followed by a space followed by a legal three letter word.

    * Line 2 through D+1:   Each line contains a legal word no longer than 80 characters, consisting only of lowercase letters, from the STGD.

    输出

    Description

    The cows are taking a trip to the lakes in Minnesota. Like everyone else, they are bored and are playing "travel games" to pass the time away.

    In this travel game, the first cow thinks of a three letter word from the Sacred Travel Game Dictionary (STGD). The next cow in line must add a letter to the word (at the beginning, between two letters, or at the end) to make another word in the STGD. The cows are curious as to just how big the final word can be.

    Given a dictionary of D (1 ≤ D ≤ 1000) words and a starting word, find any of the longest possible words that can be formed playing this travel game.

    Input

    * Line 1:   The integer D followed by a space followed by a legal three letter word.

    * Line 2 through D+1:   Each line contains a legal word no longer than 80 characters, consisting only of lowercase letters, from the STGD.

    Output

    A single line with the longest word that can be formed by extending the input seed.

    The input ensure the correct result will be unique.

    Sample Input

    9 cal
    cal
    calf
    calfs
    call
    calls
    choral
    chorale
    coal
    coral

    Sample Output

    chorale

    Hint

    From the sequence: cal, coal, coral, choral, chorale

    Source

    样例输入

    9 cal
    cal
    calf
    calfs
    call
    calls
    choral
    chorale
    coal
    coral

    样例输出

    chorale

    提示

    From the sequence: cal, coal, coral, choral, chorale


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部