[BOJ 15634] Glen

View as PDF

Submit solution

Points: 4
Time limit: 1.0s
Memory limit: 256M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

</p>

입력 형식

On the first line, I will give two positive integers N and M.</p>

N is the number of rows, and M is the number of columns.

Both integers are at most 100.

Each of the next N lines will describe each row of the tiles.

The tiles form a rectangle, remember?

Also, note that I will remove all marks on the tiles before Niko starts moving.

"#" means the mark is on that tile, and "." means the mark is not on that tile.

I guarantee that at least one tile has a mark.

출력 형식

Tell Niko exactly how they should move.</p>

"U" for up, "D" for down, "L" for left, and "R" for right.

Niko is allowed to go out of the rectangle.

예제 입력

1 1
#

예제 출력

R

Comments

There are no comments at the moment.