The next $N$ lines will contain a string of exactly $M$ characters, each of which is '.' (empty), 'R' (the robot), '#' (an obstacle), or 'E', the exit. There will be exactly one 'R' and one 'E' in the grid, and it will always be possible to navigate the robot to the exit.
를 이렇게 고쳐야 할듯 합니다:
The next $N$ lines will contain a string of exactly $M$ characters, each of which is '.' (empty), 'S' (the robot), '#' (an obstacle), or 'G', the exit. There will be exactly one 'S' and one 'G' in the grid, and it will always be possible to navigate the robot to the exit.
juneharold 2년 전
The next $N$ lines will contain a string of exactly $M$ characters, each of which is '.' (empty), '
R' (the robot), '#' (an obstacle), or 'E', the exit. There will be exactly one 'R' and one 'E' in the grid, and it will always be possible to navigate the robot to the exit.를 이렇게 고쳐야 할듯 합니다:
The next $N$ lines will contain a string of exactly $M$ characters, each of which is '.' (empty), 'S' (the robot), '
#' (an obstacle), or 'G', the exit. There will be exactly one 'S' and one 'G' in the grid, and it will always be possible to navigate the robot to the exit.