It's pretty easy to see the concept of the problem, but can you actually code it? That's the question.
NOTE: For computer programming experts, this is Problem B in the ICPC 2009 competition, Northwest division.
It seems the better way to solve this is not determining all of the possible ways the snake would fit in the grid, but work instead in a tree / recursive fashion to determine if each move is valid. When it reaches the end, count the number of moves made.
0 comments:
Post a Comment