- 博客(3)
- 收藏
- 关注
RSS订阅原创 POJ - 3984(bfs)
Time limit1000 ms Memory limit65536 kB OSLinux 题目： 定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, }; 它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不...
2019-01-29 00:02:36
162
原创 UVA-424(高精度运算)
Time limit 3000 ms 题目： One of the first users of BIT’s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those ...
2019-01-28 23:26:36
201
原创 POJ - 2421（最小生成树模板题）
Time limit 2000 ms Memory limit 65536 kB OS Linux 题目： There are N villages, which are numbered from 1 to N, and you should build some roads such that every ...
2019-01-28 21:10:54
185
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人