HDU 1288 Hat's Tea

最新推荐文章于 2018-07-17 21:44:00 发布

原创最新推荐文章于 2018-07-17 21:44:00 发布 · 826 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

当前文章被以下社区和专栏收录：

本文介绍了一个通过不同面额货币组合来精确购买饮料的算法。该算法考虑了一元、五元及十元货币的数量，并确保能够恰好支付所需金额。通过一系列条件判断，程序能够输出最佳的货币组合方式。

题目要求刚好满足买饮料的钱

#include <iostream>
using namespace std;
int main()
{
	int n,x1,x5,x10;
	int a,b,c;
	while(cin>>n>>x1>>x5>>x10&&(n+x1+x5+x10))
	{
		a=b=c=0;
		if(n%5>x1)  如果n%5大于x1，那么即使满足后面的，也有零头剩余
		{
			cout<<"Hat cannot buy tea."<<endl;
			continue;
		}
		a=n%5;        
		n-=a;
		x1-=a;
		if(n<=x1)
		{
			a=n+a;
			printf("%d YiJiao, %d WuJiao, and %d ShiJiao\n",a,b,c);
			continue;
		}
		x1/=5;
		n-=5*x1;
		a+=5*x1;
		if(n<=5*x5)
		{
			b+=n/5;
			printf("%d YiJiao, %d WuJiao, and %d ShiJiao\n",a,b,c);
			continue;
		}
		n-=5*x5;
		b=x5;
		if(n%10==0)
		{
			if(n<=10*x10){
				c+=n/10;
				printf("%d YiJiao, %d WuJiao, and %d ShiJiao\n",a,b,c);
				continue;
			}
			else
			{
				cout<<"Hat cannot buy tea."<<endl;
				continue;
			}
		}
		else
		{
			if(b>0)
				b--;
			else
			{
				if(a>=5)
					a-=5;
				else
				{
					cout<<"Hat cannot buy tea."<<endl;
					continue;
				}
			}
			n+=5;
			if(n<=10*x10)
			{
				c=n/10;
				printf("%d YiJiao, %d WuJiao, and %d ShiJiao\n",a,b,c);
				continue;
			}
			else
			{
				cout<<"Hat cannot buy tea."<<endl;
				continue;
			}
		}
	}
	return 0;
}