| |
| | Problem H - Hyper Toy Soldiers (Site not responding. Last check: 2007-10-25) |
 | | Memory Limit: 64 MB Alan's father has bought him a box of toy soldiers, k red soldiers, k green soldiers, and one gold soldier. |
 | | Each time, a soldier can move to an adjacent(north, south, east or west) square, but it can't move outside the board. |
 | | Red soldiers can only climb up, so it can move only if the target square is not lower than the current square; Green soldiers can only jump down, so it can move only if the target square is not higher than the current square; The gold soldier can move freely on the board. |
| acm.uva.es /p/v104/10418.html (543 words) |
|