2256. Scavenger Hunt

单点时限: 2.0 sec

内存限制: 256 MB

Bill has been the greatest boy scout in America and has become quite a superstar because he always organized the most wonderful scavenger hunts (you know, where the kids have to find a certain route following certain hints). Bill has retired now, but a nationwide election quickly found a successor for him, a guy called George. He does a poor job, though, and wants to learn from Bill’s routes. Unfortunately Bill has left only a few notes for his successor.

Bill never wrote down his routes completely, he only left lots of little sheets on which he had written two consecutive steps of the routes. He then mixed these sheets and memorized his routes similarly to how some people learn for exams: practicing again and again, always reading the first step and trying to remember the following. This made much sense, since one step always required something from the previous step.

George however would like to have a route written down as one long sequence of all the steps in the correct order. Please help him make the nation happy again by reconstructing the routes.

输入格式

The first line contains the number of scenarios. Each scenario describes one route and its first line tells you how many steps (3 <= S <= 333) the route has. The next S-1 lines each contain one consecutive pair of the steps on the route separated by a single space. The name of each step is always a single string of letters.

输出格式

The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print S lines containing the steps of the route in correct order. Terminate the output for the scenario with a blank line.

样例

Input
2
4
SwimmingPool OldTree
BirdsNest Garage
Garage SwimmingPool
3
Toilet Hospital
VideoGame Toilet
Output
Scenario #1:
BirdsNest
Garage
SwimmingPool
OldTree
Scenario #2:
VideoGame
Toilet
Hospital

1 人解决,4 人已尝试。

1 份提交通过,共有 6 份提交。

9.9 EMB 奖励。

创建: 14 年,8 月前.

修改: 2 年,5 月前.

最后提交: 1 月前.

来源: TUD Programming Contest 2005, Darmstadt, Germany

题目标签