poj3414专题

(POJ3414)Pots BFS, 记录路径

Pots Description 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) empty

POJ3414 Pots(BFS)

题意: 给两个不同容量的杯子,要求经过最少的操作使其中一个杯子中有cL水 要点: 也就是BFS题,只不过这题每个节点有6种方向 15304559Seasonal3414Accepted212K0MSC++2024B2016-03-23 19:34:10 #include<stdio.h>#include<string.h>#include<stdlib.h>#defin