F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Sea Sky

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1131    Accepted Submission(s): 210


Problem Description
Sea and Sky are the most favorite things of iSea, even when he was a small child.
Suzi once wrote: white dew fly over the river, water and light draw near to the sky. What a wonderful scene it would be, connecting the two charming scenery. But iSea cannot ask help from God, or some other deities in China. The only mean he can use is imagination.

For example, from sea, he can associate with love, from love, he can see sky in (strange logic, aha? leave him alone, we don't really care how he imagine since he is so weird). In this way, he connects "Sea" and "Sky" in mind, fulfills his goal.
However, he can only solve the puzzle with small number of words, when the connection increases, his brain will come to be a total mess. Now, can you smart guys help him?

Now iSea gives you some word pairs he can associate, from any one of them to another. He wishes use the maximum word to make an association list, from ¡°sea¡± to ¡°sky¡±, of course, no word should appear in the list twice because it would lead to an infinite loop. Your task is to find a list, which contains the maximum word and every neighbor word can be connected in mind. If several solutions exist, find the lexicographically minimum one.
Lexicographical sequence is the order in one dictionary. For example, ¡°cat¡± is less than ¡°do¡±, and ¡°do¡± is less than ¡°dog¡±.
 

Input
The first line contains a single integer T, indicating the number of test cases.
Each test case begins with an integer N, then N lines follow, each line contains two words can be connected in mind.

Technical Specification

1. 1 <= T <= 50
2. 1 <= N <= 100
3. The number of different words and the length of words is no more than sixteen.
 

Output
For each test case, output the case number first, if cannot finish, output ¡°what a pity¡±. Otherwise, output a word sequence with most words, separated by a blank.
 

Sample Input
3 2 sea love sky love 7 sea pure pure air air white sky white pure holy holy white sky holy 3 sea blue sky white blue green
 

Sample Output
Case 1: sea love sky Case 2: sea pure air white holy sky Case 3: what a pity
 

Author
iSea@WHU
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 15:31:58, Gzip enabled