ZOJ 1005 jugs
2016-01-24 18:42
435 查看
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.
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 超时代码如下:(T^T 不懂为什么超时) #include<iostream> using namespace std; int main() { int a, b, c, t; while(cin >> a >> b >> c) { if (a == 1) { for(t = 1; t <= c; t++) { cout << "fill A" << endl; cout << "pour A B" <<endl; } cout << "success" << endl; } t = 0; while(t != c) { cout << "fill A" << endl; cout << "pour A B" <<endl; t += a; if (t >= b) { t -= b; cout << "empty B" <<endl; cout << "pour A B" <<endl; } } cout << "success" <<endl; } return 0; } 通过代码如下(网上抄的): #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; }
相关文章推荐
- 【未完】yum源解析,配置
- hive 配置mysql元数据库
- Python
- HDU-4983-Goffi and GCD【数论】【欧拉函数】
- 【IOS学习基础】OC类的相关
- 大一下学期的自我目标
- 搜索引擎的数学原理
- GreenDao学习笔记——初始化和增删改查
- Androidx学习笔记(20)-- SQLite创建 增删改查(普通方式和API方式)
- Android系统进程间通信(IPC)机制Binder中的Server启动过程源代码分析
- [iOS]提交App报错ERROR ITMS -90207
- 30岁以上的成年人要有自己独立理性的推断力
- shell编程快速入门
- ddd
- [8]姥爷幽默谈Objective-C-继承,多态,封装
- 浅谈Android系统进程间通信(IPC)机制Binder中的Server和Client获得Service Manager接口之路
- Androidx学习笔记(19)-- SQLite 简介
- Add Binary
- PHP学习笔记 Win平台下PHP开发环境的搭建
- 使用css垂直水平居中