ZOJ Problem Set - 1005 Jugs
来源:互联网 发布:java方法覆盖 编辑:程序博客网 时间:2024/06/15 20:42
文章出处:http://blog.csdn.net/rongyongfeikai2/article/details/7315702
作者思路简单易懂,借鉴了~~~
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
思路:
由于bottle2的容量一定大于bottle1的容量,所以bottle2一定可以最终放入指定的水量。
要解这道题目,按照以下算法:
1.判断bottle1中是否有水,没有水就灌满水
2.将bottle1中的水放入bottle2中
3.判断bottle2是否等于指定水量,如果没有,那么就将bottle2清空
#include <stdio.h>int main(){int a, b, p;int bottle1, bottle2;while (scanf("%d%d%d", &a, &b, &p) != EOF){bottle1 = 0;bottle2 = 0;while (1){if (bottle1 == 0){bottle1 = a;printf("fill A\n");}else if (bottle1 + bottle2 <= b){bottle2 += bottle1;bottle1 = 0;printf("pour A B\n");}else{bottle1 = bottle1 - (b - bottle2);bottle2 = b;printf("pour A B\n");}if (bottle2 == p){printf("success\n");break;}if (bottle2 == b){bottle2 = 0;printf("empty B\n");}}}return 0;}
- ZOJ Problem Set - 1005 Jugs
- ZOJ Problem Set - 1005 Jugs
- ZOJ Problem Set - 1005 Jugs
- ZOJ Problem Set - 1005 Jugs
- ZOJ Problem Set - 1005
- 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 【BFS】
- ZOJ 1005 Jugs
- zoj 1005 jugs
- ZOJ 1005 Jugs
- zoj 1005Jugs
- zoj 1005 Jugs (模拟)
- 滚动视图
- MFC socket 发送文件
- 《程序员的自我修养》系列技术文章整理收藏
- 设计模式之二十:责任链模式(Chain of Responsibility)
- 阿米巴经营模式
- ZOJ Problem Set - 1005 Jugs
- 关于学程序需不需要学习英语的忠告
- 一点对C语言中跳过scanf语句的理解
- 一个优秀的程序员需要擅长数学吗
- PHP 构造方法说明
- UIButton 导航栏属性
- c++中 dialog、bitmap等资源,由一个项目完全复制到另一个项目的方法
- HDU ACM 5265 pog loves szh II
- 【Oracle篇】Navicat连接Oracle数据库