pku2581.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>

int main()
{
	int A, sm[4], ans[4], tmp, a, b, all, min;
	int i0, i1, i2, i3;

	while (scanf("%d.%d %d %d %d %d", &a, &b, &sm[0], &sm[1], &sm[2], &sm[3]) != -1)
	{
		all = a * 100 + b;
		min = all + 1;
		for (i0 = 0; i0 <= sm[0]; i0++)
		{
			if (i0 * 25 > all)
			{
				break;
			}
			for (i1 = 0; i1 <= sm[1]; i1++)
			{
				if (i0 * 25 + i1 * 10 > all)
				{
					break;
				}
				for (i2 = 0; i2 <= sm[2]; i2++)
				{
					if (i0 * 25 + i1 * 10 + i2 * 5 > all)
					{
						break;
					}
					i3 = all - i0 * 25 - i1 * 10 - i2 * 5;
					if (i3 >= 0 && i3 <= sm[3])
					{
						tmp = i0 + i1 + i2 + i3;
						if (tmp < min)
						{
							min = tmp;
							ans[0] = i0;
							ans[1] = i1;
							ans[2] = i2;
							ans[3] = i3;
						}
					}
				}
			}
		}
		if (min == all + 1)
		{
			printf("NO EXACT CHANGE\n");
		}
		else
		{
			printf("%d %d %d %d\n", ans[0], ans[1], ans[2], ans[3]);
		}
	}
	return 0;
}