Олимпиадные задачи по программированию. Ч. 4. Лучшие решения. Ускова О.Ф - 40 стр.

UptoLike

Составители:

Рубрика:

The results - the type and the number of the ships are displayed

line-by-line.

Nomination “ For students majoring in informatics” .

“ Labyrinth”

Labyrinth is a set of identical rooms. Each of them has from 1 to 4

doors to the neighboring rooms. A traveler entered the labyrinth and

wandered there until he found the way out. Each time while turning

into another room he made a note, marking the direction of the

movement with the letters: N – North, E – East, S – South, W –

West.

By the given route description you need to determine the shortest

way which leads from the entrance to the exit and covers the rooms

where the traveler has been.

Technical requirements

Input data are taken from the text file INPUT.TXT. Its first line

contains the number of the passages from one room to another, and

each next contains one of the letters N, E, S, W.

Output data is a line of characters which is output to the text file

OUTPUT.TXT and to the screen.

Nomination “ For students majoring in humanities” .

“ A and B”

The input text is a sentence containing enumeration of two objects

joined by “and”. You need to swap the words joined by this

conjunction. For example, the text “A and B were sitting on a tube”

after transformation should be “B and A were sitting on a tube”

Applied software section.