ZOJ 1005 Jugs(模拟 special judge,也可以BFS)
来源:互联网 发布:字幕自动生成软件 编辑:程序博客网 时间:2024/05/01 00:27
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.
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 45 7 3
Sample Output
fill Bpour B Aempty Apour B Afill Bpour B Asuccessfill Apour A Bfill Apour A Bempty Bpour A Bsuccess
#include<iostream>#include<cstdio>#include<cmath>using namespace std;int main(){ int ca,cb,x; int a,b,t; while(cin>>ca>>cb>>x) { a=0,b=0; while(1) { if(a==0) //A装满 { puts("fill A"); a=ca; } if(a==x||b==x) break; puts("pour A B"); if(b+a>=cb) //B装满了 a=b+a-cb,b=cb; else b=b+a,a=0; if(a==x||b==x) break; if(b==cb) { puts("empty B"); b=0; } } puts("success"); } return 0;}/*3 5 45 7 37 7 2*/
- ZOJ 1005 Jugs(模拟 special judge,也可以BFS)
- ZOJ 1005 Jugs 【BFS】
- zoj 1005 Jugs BFS
- zoj 1005 Jugs (模拟)
- 模拟 zoj 1005 Jugs
- Special Special Judge III ZOJ
- ZOJ-1005-Jugs【BFS+记录路径】
- zoj 1005 Jugs(数学做法,还可以用BFS(我不会))
- ZOJ-1005-Jugs
- ZOJ 1005 Jugs
- ZOJ 1005 Jugs
- zoj 1005 Jugs
- ZOJ 1005 Jugs (DFS)
- zoj 1005 Jugs
- zoj 1005 Jugs
- ZOJ 1005 Jugs
- zoj 1005 jugs
- ZOJ 1005 Jugs
- 铁道部新客票系统的设计(二)
- openstack维护过程中遇到的问题
- 做技术需要有专研的精神
- 铁道部新客票系统的设计(三)
- svn使用别名 映射ip,出差时候就方便多了
- ZOJ 1005 Jugs(模拟 special judge,也可以BFS)
- 邮箱有效性检测(nslookup -q=mx)
- boost使用(八)
- Jlink+RVDS单步调试 ARM11(S3C6410)裸奔程序
- Python学习第四天
- loadrunner之脚本录制
- C#动态创建控件之事件响应(刚刚答复提问,正好一并录之)
- Directory 与 Hashtable 的性能比较
- git错误error: Your local changes to the following files would be overwritten