ZOJ 1005 POJ 1606 Jugs /数论
来源:互联网 发布:量子数据 编辑:程序博客网 时间:2024/05/17 09:14
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
就是给你2个互素的壶 倒水 最后 等于n 第一个a小于第二个b
每次看a是不是空的 空的装满 倒往b 然后 b满了就清空
一定有解 不过不唯一
非原创 参考网上
#include<stdio.h>int main(){ int a,b,p; int b1,b2; while(scanf("%d%d%d",&a,&b,&p)!=EOF) { b1=0; b2=0; while(1) { if(b1==0) { b1=a; puts("fill A"); } if(b2+b1<=b) { b2+=b1; b1=0; } else { b1=b1-(b-b2); b2=b; } printf("pour A B\n"); if(b2==p) { puts("success"); break; } if(b2==b) { b2=0; puts("empty B\n"); } } } return 0; }
- ZOJ 1005 POJ 1606 Jugs /数论
- zoj 1005 Jugs || poj 1606 (广搜做法~~~~)
- 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 (模拟)
- 模拟 zoj 1005 Jugs
- zoj 1005 Jugs
- zoj 1005 Jugs
- javaweb 之 总结篇
- hdu 4619 Warm up 2 (两种解法:1.并查集 2.最大独立集)
- POJ 1068 括号匹配问题
- android读取文件权限
- hdu4620 Fruit Ninja Extreme---dfs
- ZOJ 1005 POJ 1606 Jugs /数论
- WEBAPP介绍及其iOS Web开发技巧总结
- DDR2芯片内部终结ODT .
- poj3268 Silver Cow Party(SPFA)
- 在Eclipse中配置SVN忽略文件
- DDR1&2&3信号完整性测试分析技术探析
- ListView用法总结
- 求数组中出现次数超过一半的元素
- Stanford Machine Learning -- 第六讲 SVM