22686_Pots

2022-5-16 18:22| 发布者: Hocassian| 查看: 23| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506854418700-Problem List-采集的数据-后羿采集器.html

Pro.ID

22686

Title

Pots

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22686

AC

0

Submit

43

Ratio

0.00%

时间&空间限制

  • Time Limit: 1000/500 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)
  • 描述

    You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:

    1) FILL(i)         fill the pot i  ( 1 ≤ i ≤ 2 ) from the tap;

    2) DROP(i)      empty the pot i to the drain;

    3) 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)

    输出

    Description

    You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:

    1) FILL(i)         fill the pot i  ( 1 ≤ i ≤ 2 ) from the tap;

    2) DROP(i)      empty the pot i to the drain;

    3) 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 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

    样例输入

    3 5 4

    样例输出

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

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部