Description: 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
To Search:
File list (Check if you may need any files):
uva10116\uva10116#a.in.txt
........\uva10116#a.out.txt
........\uva10116#b.in.txt
........\uva10116#b.out.txt
........\uva10116_1101105324.cpp
........\uva10116_1101105324.exe
........\uva10116_readme.txt
uva10116
Download