nyoj 667 Biggest Number 搜索 减枝 dfs bfs
题目:
Biggest Number
时间限制:1000 ms | 内存限制:65535 KB
难度:4
描述
You have a maze with obstacles and nonzero digits in it:You can start from any square, walk in the maze, and finally stop at some square.
原创
2016-04-26 13:52:08 ·
726 阅读 ·
0 评论