摘要：
Knight MovesDescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The Problem Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one 阅读全文
摘要：
深搜，从一点向各处搜找到所有能走的地方。Red and BlackTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 12004Accepted: 6097DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacen 阅读全文