BFS
文章平均质量分 77
u011123263
这个作者很懒,什么都没留下…
展开
-
Rescue
Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach Angel.原创 2013-11-11 09:09:46 · 692 阅读 · 0 评论 -
九数码
Problem DescriptionNine tiles, each with a number from 1 to 9 on it, are packed into a 3 by 3 frame. Your task is to arrange the tiles so that they are ordered as 1 2 34 5 67 8 9At each step, you原创 2014-08-28 17:16:14 · 518 阅读 · 0 评论 -
分糖果
Problem Description童年的我们将和朋友分享美好的事物作为自己的快乐。这天,C小朋友得到了糖果,将要把这些糖果分给要好的朋友们。已知糖果从一个人传给另一个人需要1秒的时间,同一个小朋友不会重复接受糖果。由于糖果足够多,如果某时刻某小朋友接受了糖果,他会将糖果分成若干份,分给那些在他身旁且还没有得到糖果的小朋友们,而且自己会吃一些糖果。由于嘴馋,小朋友们等不及将糖果发完,会在得到糖原创 2014-07-29 19:49:04 · 882 阅读 · 0 评论 -
Fire Game
Problem DescriptionFat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty原创 2014-08-04 11:03:41 · 999 阅读 · 0 评论 -
三个水杯
描述给出三个水杯,大小不一,并且只有最大的水杯的水是装满的,其余两个为空杯子。三个水杯之间相互倒水,并且水杯没有标识,只能根据给出的水杯体积来计算。现在要求你写出一个程序,使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数N(0接下来每组测试数据有两行,第一行给出三个整数V1 V2 V3 (V1>V2>V3 V10)表示三个水杯的体积。第二行给出三个整数E原创 2014-07-22 20:24:41 · 471 阅读 · 0 评论 -
最少步数
描述这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1 1,1,0,1,0,1,0,0,1 1,1,0,1,0,0,0,0,1 1,1,1,1,1,1原创 2014-07-16 14:51:46 · 441 阅读 · 0 评论 -
最少转弯问题
Problem Description给出一张地图,这张地图被分为n*m(n,mInput输入有多组数据,每组数据的第一行为n和m,第2至n+1行为整个地图地形描述(0:空地;1:高山),第n+2行为起点坐标x1,y1,终点坐标x2,y2。Output对于每组数据输出最少转弯次数。Sample Input5 71 0 0 0 0 1 00原创 2014-03-08 18:13:25 · 3397 阅读 · 0 评论 -
细胞
Problem Description一矩形阵列由数字0到9组成,数字1到9代表细胞,细胞的定义为沿细胞数字上下左右还是细胞数字则为同一细胞,求给定矩形阵列的细胞个数。Input输入第一行为T,表示有T组测试数据,对于每组测试数据第一行为m和n(1Output对于每组测试数据,输出矩阵中的细胞个数。Sample Input14 100原创 2013-11-13 22:16:22 · 933 阅读 · 0 评论 -
Nightmare
Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial原创 2013-11-12 20:49:50 · 843 阅读 · 0 评论 -
奇怪的电梯
Problem Description大楼的每一层楼都可以停电梯,而且第i层楼(1Input输入第一行为T,表示数据组数,对于每组数据的共二行,第1行为三个用空格隔开的正整数,表示N,A,B(1Output对于每组数据输出最少按键次数,若无法到达,输出-1。Sample Input15 1 53 3 1 2 5Sample O原创 2013-11-24 21:29:16 · 1616 阅读 · 0 评论 -
Interesting Calculator
DescriptionThere is an interesting calculator. It has 3 rows of buttons.Row 1: button 0, 1, 2, 3, ..., 9. Pressing each button appends that digit to the end of the display.Row 2: button +0, +1,原创 2014-10-07 16:37:08 · 690 阅读 · 0 评论