BFS
岩霏
这个作者很懒,什么都没留下…
展开
-
LightOJ 1141 Number Transformation
Number TransformationIn this problem, you are given an integer number s. You can transform any integer number A to another integer number B by adding x to A. This x is an integer number which is a prim转载 2017-07-31 17:38:16 · 233 阅读 · 0 评论 -
poj 1383 Labyrinth
poj 1383 Labyrinth 【 BFS实现 树的直径裸题】 The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either filled by rock, or原创 2017-08-01 20:52:17 · 421 阅读 · 0 评论 -
P1162 填涂颜色
题目描述 由数字 00 组成的方阵中,有一任意形状闭合圈,闭合圈由数字 11 构成,围圈时只走上下左右 44 个方向。现要求把闭合圈内的所有空间都填写成 22 .例如: 6 \times 66×6 的方阵( n=6n=6 ),涂色前和涂色后的方阵如下: 0 0 0 0 0 0 0 0 1 1 1 1 ...原创 2018-06-10 16:36:36 · 319 阅读 · 0 评论