POJ 3414 Pots 倒水问题 + 回溯

这个题目在找翻译的时候百度一下居然搜到了博客园 神犇（以为非常大佬的博客 大家可以去看一下 博客园ID就是这个） 的博客，莫名的就是一种感触，想一想恍然间已经过去三年多了，好多事情零零碎碎的又突然浮现在眼前，只能道一句“天道有轮回，世事有因果”。
还记得杜老师说：“似水流年，我们站在岁月的河边看花开花落，看流水轻轻划过，河面上是落英缤纷，以及逝去的年华。”

Pots

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 31715 Accepted: 13140 Special Judge
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 the pot i to the drain;
POUR(i,j) pour from pot i to pot j; after this operation either the pot j is full (and there may be some water left in the pot i), or the pot i is empty (and all its contents have been moved to the pot j).
Write a program to find the shortest possible sequence of these operations that will yield exactly C liters of water in one of the pots.

Input

On the first and only line are the numbers A, B, and C. These are all integers in the range from 1 to 100 and C≤max(A,B).

Output

The first line of the output must contain the length of the sequence of operations K. The following K lines must each describe one operation. If there are several sequences of minimal length, output any one of them. If the desired result can’t be achieved, the first and only line of the file must contain the word ‘impossible’.

Sample Input

3 5 4
Sample Output

6
FILL(2)
POUR(2,1)
DROP(1)
POUR(2,1)
FILL(2)
POUR(2,1)
Source

Northeastern Europe 2002, Western Subregion

题目大意 :
倒水问题，并输出一中可行方案。 1号瓶子容量为A ， 2号瓶子容量为B
为最少多少次能让某个瓶子中水量为C
题目分析：
BFS 记录状态 + 回溯