Jugs
Time Limit: 1000MS | Memory Limit: 65536K | |||
Total Submissions: 4142 | Accepted: 2458 | Special Judge |
Description
In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fill the 5-gallon jug with exactly 4 gallons. This problem generalizes that puzzle.
You have two jugs, A and B, and an infinite supply of water. There are three types of actions that you can use: (1) you can fill a jug, (2) you can empty a jug, and (3) you can pour from one jug to the other. Pouring from one jug to the other stops when the first jug is empty or the second jug is full, whichever comes first. For example, if A has 5 gallons and B has 6 gallons and a capacity of 8, then pouring from A to B leaves B full and 3 gallons in A.
A problem is given by a triple (Ca,Cb,N), where Ca and Cb are the capacities of the jugs A and B, respectively, and N is the goal. A solution is a sequence of steps that leaves exactly N gallons in jug B. The possible steps are
fill A
fill B
empty A
empty B
pour A B
pour B A
success
where "pour A B" means "pour the contents of jug A into jug B", and "success" means that the goal has been accomplished.
You may assume that the input you are given does have a solution.
You have two jugs, A and B, and an infinite supply of water. There are three types of actions that you can use: (1) you can fill a jug, (2) you can empty a jug, and (3) you can pour from one jug to the other. Pouring from one jug to the other stops when the first jug is empty or the second jug is full, whichever comes first. For example, if A has 5 gallons and B has 6 gallons and a capacity of 8, then pouring from A to B leaves B full and 3 gallons in A.
A problem is given by a triple (Ca,Cb,N), where Ca and Cb are the capacities of the jugs A and B, respectively, and N is the goal. A solution is a sequence of steps that leaves exactly N gallons in jug B. The possible steps are
fill A
fill B
empty A
empty B
pour A B
pour B A
success
where "pour A B" means "pour the contents of jug A into jug B", and "success" means that the goal has been accomplished.
You may assume that the input you are given does have a solution.
Input
Input to your program consists of a series of input lines each defining one puzzle. Input for each puzzle is a single line of three positive integers: Ca, Cb, and N. Ca and Cb are the capacities of jugs A and B, and N is the goal. You can assume 0 < Ca <= Cb and N <= Cb <=1000 and that A and B are relatively prime to one another.
Output
Output from your program will consist of a series of instructions from the list of the potential output lines which will result in either of the jugs containing exactly N gallons of water. The last line of output for each puzzle should be the line "success". Output lines start in column 1 and there should be no empty lines nor any trailing spaces.
Sample Input
3 5 4 5 7 3
Sample Output
fill B pour B A empty A pour B A fill B pour B A success fill A pour A B fill A pour A B empty B pour A B success
Source
South Central USA 1997
解题思路:本题是泊松倒酒问题的一种,网上人大多是bfs过的,但是本弱菜一开始就没看出这是一个搜索的问题,于是把他当数论来做了(嘛,虽然我自己也不会证明,但是从网上看倒酒过程是有规律可证的)。倒酒过程如下:
解题思路:本题是泊松倒酒问题的一种,网上人大多是bfs过的,但是本弱菜一开始就没看出这是一个搜索的问题,于是把他当数论来做了(嘛,虽然我自己也不会证明,但是从网上看倒酒过程是有规律可证的)。倒酒过程如下:
1.首先小酒瓶为空的时候倒满。 2.大酒瓶满的时候倒空,再把小酒瓶中的酒倒入大酒瓶。 3.大酒瓶不满,小酒瓶不空的时候,分两种情况讨论: (1)小酒瓶的酒全倒入大酒瓶不会溢出,则将其全部倒入大酒瓶 (2)小酒瓶的酒全倒入大酒瓶会溢出,则倒入一部分至大酒瓶,使其恰好装满。 对于以上三种情况对应输出题目要求的内容,直至达到目标输出success。
代码如下:
#include<iostream>
using namespace std;
int main()
{
int i,j,k,a,b,c;
while(cin>>a>>b>>c)
{
i=j=k=0;
while(j!=c)
{
if(j==b)
{
j=0;
cout<<"empty B"<<endl;
j+=i;
cout<<"pour A B"<<endl;
i=0;
continue;
}
if(i==0)
{
i=a;
cout<<"fill A"<<endl;
continue;
}
if(j!=c)
{
if(j+i>b)
{
k=b-j;
i-=k;
j+=k;
}
else
{
j+=i;
i=0;
}
cout<<"pour A B"<<endl;
continue;
}
}
cout<<"success"<<endl;
}
return 0;
}
如果哪位神犇能证明之,不胜感激+膜拜,顺便求加我qq:970445054