今天和家人一起去置办年货了,买了好多好吃的
嘿嘿^_^
今天还是搜索吧 emmm。。。
Pots
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 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’.
翻译:
锅
给你两个罐子,容量分别为A和B升。可以执行以下操作:
把罐子装满≤ 我≤ 2) 从水龙头;
滴(i)将罐i排空至排水管;
浇注(i,j)从罐i向罐j浇注;此操作后,罐j已满(罐i中可能还有一些水),或罐i已空(其所有内容物已移至罐j)。
编写一个程序,找出这些操作的最短可能顺序,在其中一个罐中正好产生C升水。
输入
第一行也是唯一一行是数字A、B和C。这些都是介于1到100和C之间的整数≤马克斯(A,B)。
输出
输出的第一行必须包含操作序列K的长度。以下K行必须分别描述一个操作。如果有多个最小长度的序列,则输出其中任何一个。如果无法实现所需的结果,则文件的第一行(也是唯一一行)必须包含单词“不可能”。
明天周练,希望可以多AC几个 咳咳