weixin_43866317的博客

POJ-3414-BFS+路径输出You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i) ...

poj-3126The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.— It is a matt...

hdu-1495题解：然后每种状态里面又分两种不同情况，可以将此瓶的水全部清空，不能清空…现在要求最少经过多少步就能平分那么多水首先剪枝是 如果s是奇数必然不行。一看到要求最少的步数就知道用bfs了我们用vis标记状态每个状态有三个整数组成 表示这三个杯子里的可乐数量然后对每个状态的递推是 6种 也就是3!种。从一个到到另一个 再标记 入队emmm这也是别人的题解#includ...

题目链接: poj-2251这个题目的难度在于三维空间，不好去理解题意，分析去它的坐标变化，然后用结构体，三维数组，队列去处理，问题就好办多了！#include<iostream>#include<cstdio>#include<cstring>#include<queue>using namespace std;char map[...