uva 10116

1. 假設兩陣列，一個存網格，一個存機器人所走的第幾個位置



2. 起始點設為第1格，判斷網格，改變 x , y 值



3. 判斷 x , y 值，抄出網格為成功走出，印出步數，步數為位置減 1



4. 如果走到不為 0 的格子，表示走到之前走過的路線，進入迴圈



5. 印出所遇的位置之步數，並印出進入迴圈前位置之步數-uva 10116 1. assume two arrays, a deposit grid, a deposit robot go in the first few positions 2. Set the starting point of the first grid, the grid is determined to change the x, y value judgment 3. x, y values , ferreted out the grid for the successful, print out a few steps, the number of steps for the location minus 1 4. If not for the grid went to 0, indicating that the route went through before, enter the loop 5. The position of the printed encountered the number of steps, and print the number of steps before entering the loop location