Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Pots
Description You are given two pots, having the volume of - 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 Input On the first and only line are the numbers Output The first line of the output must contain the length of the sequence of operations 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 |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator