1005.cpp

来自「acm.zju.edu.cn第1074,1005,1010题」· C++ 代码 · 共 44 行

// zoj 1005(具体的可行性可由欧几里德扩展定理求得)
# include <iostream>
using namespace std;
int main()
{
        int a,b,c,ta,tb;
        while(cin>>a>>b>>c)
		{
			ta=0;tb=0;
			while(ta!=c&&tb!=c)
			{
				if(ta==0) 
				{
				cout<<"fill A"<<endl;
				 ta=a;
                 }
                 else 
				 {
					if(tb==b)
					{
						cout<<"empty B"<<endl;
                        tb=0;
                     }
                     else 
					 {
						cout<<"pour A B"<<endl;
							if(ta<b-tb)
							{
								tb+=ta;
                                ta=0;
                             }
                            else 
							{
								ta-=b-tb;
                                tb=b;
                             }
                      }
				}
			}
            cout<<"success"<<endl;
		}
        return 0;
}