搜索题
m悟空
这个作者很懒,什么都没留下…
展开
-
Saving Tang Monk II (bfs)
《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming Dynasty. In this novel, Monkey King Sun Wukong, pig ...原创 2018-09-23 08:56:37 · 615 阅读 · 0 评论 -
Eight (八数码 + 康拓展开式)
The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed...原创 2019-04-09 16:11:16 · 754 阅读 · 2 评论 -
Black And White (染色问题,剪枝)
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors a...原创 2019-04-11 08:23:06 · 704 阅读 · 2 评论 -
Fair ( 多源bfs )
Some company is going to hold a fair in Byteland. There arenntowns in Byteland andmmtwo-way roads between towns. Of course, you can reach any town from any other town using roads.There arekkty...原创 2019-03-21 21:19:06 · 427 阅读 · 0 评论 -
推箱子(四维bfs)
推箱子是一个很经典的游戏.今天我们来玩一个简单版本.在一个M*N的房间里有一个箱子和一个搬运工,搬运工的工作就是把箱子推到指定的位置,注意,搬运工只能推箱子而不能拉箱子,因此如果箱子被推到一个角上(如图2)那么箱子就不能再被移动了,如果箱子被推到一面墙上,那么箱子只能沿着墙移动.现在给定房间的结构,箱子的位置,搬运工的位置和箱子要被推去的位置,请你计算出搬运工至少要推动箱子多少格....原创 2019-03-20 21:52:43 · 504 阅读 · 0 评论 -
Abbott's Revenge (bfs转向问题)
The 1999 World Finals Contest included a problem based on a dice maze. At the time the problemwas written, the judges were unable to discover the original source of the dice maze concept. Shortlya...原创 2018-06-04 00:37:56 · 601 阅读 · 0 评论 -
Eight (八数码 + 打表)
The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed...原创 2018-07-22 15:41:00 · 881 阅读 · 3 评论 -
Sticks (dfs 剪枝)
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had orig...原创 2018-07-22 16:01:36 · 663 阅读 · 0 评论 -
Dating with girls(2) (bfs)
If you have solved the problem Dating with girls(1).I think you can solve this problem too.This problem is also about dating with girls. Now you are in a maze and the girl you want to date with is als...原创 2018-07-22 16:25:21 · 152 阅读 · 0 评论 -
Flip Game (开关问题)
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's bl...原创 2018-07-26 18:04:12 · 1546 阅读 · 1 评论 -
Escape (可待在原地的bfs)
The students of the HEU are maneuvering for their military training. The red army and the blue army are at war today. The blue army finds that Little A is the spy of the red army, so Little A has to ...原创 2018-07-26 18:39:25 · 522 阅读 · 0 评论 -
Unit Fraction Partition (dfs)
A fraction whose numerator is 1 and whose denominator is a positive integer is called a unit fraction. A representation of a positive rational number p/q as the sum of finitely many unit fractions is ...原创 2018-07-26 19:14:38 · 554 阅读 · 0 评论 -
The Pilots Brothers' refrigerator (开关问题 )
The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refrigerator door. Every handle can be in one of two...原创 2018-07-26 20:41:29 · 597 阅读 · 0 评论 -
How many ways (记忆化搜索)
这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下: 1.机器人一开始在棋盘的起始点并有起始点所标有的能量。 2.机器人只能向右或者向下走,并且每走一步消耗一单位能量。 3.机器人不能在原地停留。 4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量。 如上图,机器人一开始在(1,1)点...原创 2018-07-29 13:14:45 · 1528 阅读 · 0 评论 -
Free Candies (dfs + 栈)
Little Bob is playing a game. He wants to win some candies in it - as many as possible.There are 4 piles, each pile contains N candies. Bob is given a basket which can hold at most 5 candies. Each t...原创 2018-07-29 13:55:51 · 227 阅读 · 0 评论 -
超级密码 (bfs + c进制还原数+同余定理)
Ignatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息: 密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0<=N<=5000)的正整数倍(如果存在多个满足条件的数,那么最小的那个就是密码),如果这样的密码存在,那么当你输入它以后门将打开,如果不存在这样的密码....原创 2018-08-26 17:17:12 · 460 阅读 · 0 评论 -
Childhood dream (猜数字)
题目描述你童年时期就有一个梦想,想要加入 ACM(Association of Calculation and Magic),今天,这个机会终于 来了。但是 ACM 只想要哪些天赋异禀的人, 比如像 tourist,他们给了你一道题来检测你是否足够机智。猜一个长度为 m 数字串,总共有 n 个提示串,解释如下:8640 0A2BA 前面的数字说明与答案相比,有多少个位置...原创 2019-04-17 13:37:21 · 539 阅读 · 0 评论