找零钱算法设计与分析

最新推荐文章于 2024-07-19 22:36:19 发布

牛小汉

最新推荐文章于 2024-07-19 22:36:19 发布

阅读量79

点赞数 1

分类专栏：算法答案深圳技术大学文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/weixin_62377608/article/details/131792022

版权

算法答案深圳技术大学专栏收录该内容

58 篇文章 18 订阅

订阅专栏

Description:

Accept:

#include<bits/stdc++.h>
using namespace std;
int record[10005], money[7] = { 100, 50, 20, 10, 5, 2, 1 };
bool cmp(int a, int b) {
	return a > b;
}
int main()
{
	int target = 0;
	while (cin >> target) {
		memset(record, 0, sizeof(record));
		int len = 0, now = 0;
		while (now < target) {
			int m = 0;
			if (now == target) {
				break;
			}
			while (m<7&&now + money[m] > target) {
				m++;
			}
			if (m == 7 || now == target) {
				break;
			}
			record[len++] = money[m];
			now += money[m];
		}
		cout << len << " ";
		sort(record, record + len, cmp);
		int j = 0, cnt = 0, nowprint = 0;
		while (j < len) {
			cnt = 0;
			nowprint = record[j];
			while (nowprint == record[j]) {
				j++;
				cnt++;
			}
			if (cnt == 1&&j!=len) {
				cout << nowprint << "+";
			}
			if (cnt > 1 && j != len) {
				cout << nowprint << "*" << cnt << "+";
			}
			if (cnt == 1 && j == len) {
				cout << nowprint << "=";
			}
			if (cnt > 1 && j == len) {
				cout << nowprint << "*" << cnt << "=";
			}
		}
		cout << target << endl;
	}
	return 0;
}