ZOJ 1005 Jugs （倒水问题）

原题：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1005

//假设B大的话，那么把最终要求的容量放在B的话就没问题//那么每次先灌A满，然后不断地往B倒，B如果满了还是没达到要求，就清空#include<iostream>using namespace std;int main(){int Va,Vb,Vn,bottle_a,bottle_b;while(cin>>Va>>Vb>>Vn)//输入容量{bottle_a=bottle_b=0;if(Vb==Vn){cout<<"fill B"<<endl<<"success"<<endl;continue;}if(Va==Vn){cout<<"fill A"<<endl<<"pour A B"<<endl<<"success"<<endl;continue;}while(bottle_b!=Vn){if(bottle_a==0){cout<<"fill A"<<endl;bottle_a = Va;}if(bottle_b==Vb){bottle_b = 0;cout<<"empty B"<<endl;}if(bottle_a>(Vb-bottle_b)){bottle_a-=(Vb-bottle_b);bottle_b=Vb;cout<<"pour A B"<<endl;}else{bottle_b+=bottle_a;bottle_a=0;cout<<"pour A B"<<endl;}}cout<<"success"<<endl;}}