找零钱

最新推荐文章于 2015-05-09 18:34:43 发布

xiaohanstu

最新推荐文章于 2015-05-09 18:34:43 发布

阅读量601

点赞数

分类专栏：入职练习文章标签：华为入职练习华为OJ

本文链接：https://blog.csdn.net/xiaohanstu/article/details/42318815

版权

入职练习专栏收录该内容

58 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>


int main()
{
	int iNum =0;
	int cofficients[6] = {0};
	while (EOF != scanf("%d", &iNum) && 0 != iNum )
	{
		int iCount =0;
		for (cofficients[0] =0; cofficients[0] <= iNum; ++cofficients[0])
		{
			for (cofficients[1] =0; cofficients[1] <= iNum/2; ++cofficients[1] )
			{
				for (cofficients[2] =0; cofficients[2] <= iNum/5; ++cofficients[2] )
				{
					for (cofficients[3] =0; cofficients[3] <= iNum/10; ++cofficients[3] )
					{
						for (cofficients[4] =0; cofficients[4] <= iNum/50; ++cofficients[4] )
						{
							for (cofficients[5] =0; cofficients[5] <= iNum/100; ++cofficients[5] )
							{
								if (iNum == cofficients[0] + 2*cofficients[1] + 5*cofficients[2] + 10 * cofficients[3] + 50*cofficients[4] +100 * cofficients[5])
								{
									iCount++;
								}
							}
						}
					}
				}
			}
		}
		printf("%d\n", iCount);
	}
	return 0;
}