题目描述
There was a man who was addicted to find the right way of the mazes. One day, by accident, he got a maze. However, because of the superior difficulty, he can't find the right way, so he ask you for help.
Write a program to solve a maze by the shortest route possible.
The maze should be read from the standard input. The first line of input will be the number of lines of input in the maze followed by the number of columns in each line.
Each piece of the maze is defined using a single letter:
-W means this piece is a wall and cannpt be passed through
-C means this piece is a corridor and can be passed through
-S means that this piece is the start location
-E means that this piece is the end location
Each entry on the line is separated by a single space.
输入格式
next m lines you should enter the whole maze.
(m,n<=36)
输出格式
If there is no possible solution to the maze the result should be "There is no solution to this maze"
样例输入
10 11 W W W W W W W W W W W W S W C C C W C C C W W C W C W C W C W W W W C W C W C W C C C W W C W C W C W W W W W W C C C W C W C C C W W C W C W C C C W W W W C W C W C W C C C W W C W W W C W W W E W W W W W W W W W W W W
样例输出
W W W W W W W W W W W W X W X X X W C C C W W X W X W X W C W W W W X W X W X W C C C W W X W X W X W W W W W W X X X W X W C C C W W C W C W X X X W W W W C W C W C W X X X W W C W W W C W W W X W W W W W W W W W W W W