Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem E
Peter Takes a Tramway
Input: standard input
Output: standard output
Time Limit: 2 seconds

Main Town has a well-developed system of tramway network. Since most of the important buildings in town are located along the Main Street, almost all the tramways pass through the street. All the stops along the Main Street, and there are very many of them, are numbered with numbers: 0, 1, 2 and so on. All the tramways enter the Main Street at the stop numbered 0 and continue towards the higher numbered stops. For each tramway line, which is identified also by a number, there is a schedule posted at stop 0 giving the minutes within an hour when a tramway of this line leaves the stop.

Peter arrives at stop 0 at m minutes (0 <= m < 60) after an hour and takes the first tramway that leaves stop 0 along the Main Street. If Peter arrives at stop 0 the same minute when a tram leaves, Peter manages to board the tram. He leaves the tram at the next stop and takes the next tram that arrives and continues to the next stop where he leaves. Peter continues in this fashion until he reaches stop 0 < n < 1000000000. By which tram will Peter arrive at stop n?

Input

Input contains multiple cases. The first line of a case gives t, the number of tramway lines, 0<t<30. The next t lines each contain a number of a tram line followed by a colon and then a list (separated by spaces) of minutes after a full hour when the tram of this line leaves stop 0. Each list of departure times is terminated by -1. No tram leaves stop 0 more than 20 times in an hour, no two trams leave station 0 at the same time, all the trams have the same speed and they never meet at a stop. A line with m and n then follows. The input ends with a line where t= 0. This line should not be processed.

Output

For each case of input, output in a format shown below the number of the tram line by which Peter arrives at stop n.

Sample Input

1

11: 10 20 30 -1

3 2

2

11: 10 20 30 -1

134: 16 25 35 45 58 -1

48 783

0

Sample Output

Case 1: Peter arrives at stop 2 by tram 11.

Case 2: Peter arrives at stop 783 by tram 134.

(Problem-setters: Piotr Rudnicki, University of Alberta, Canada) 

“If the educational system of an institute is based on mere memorization

and directionless class notes then it surely will struggle to

arrange a proper programming contest.”

題目描述：

Peter 要搭電車抵達某一個地方，一開始從站牌 0 時刻 m 開始，

每到一個站後會下來等下一班電車再往下一個前進。

給所有電車從站牌 0 發車的時間，問抵達第 n 個站是用哪一班車。