openjudge_2.5基本算法之搜索_2152:Pots

最新推荐文章于 2024-05-21 23:16:53 发布

VIP文章 adam_life

最新推荐文章于 2024-05-21 23:16:53 发布

阅读量713

点赞数 21

文章标签：算法宽搜状态，包含各元素

本文链接：https://blog.csdn.net/adam_life/article/details/138379343

版权

题目

2152:Pots
总时间限制: 1000ms 内存限制: 65536kB
描述
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.

输入
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).

输出
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