uvaoj 357 - Let Me Count The Ways 动态规划

最新推荐文章于 2024-02-25 13:01:22 发布

gwq5210

最新推荐文章于 2024-02-25 13:01:22 发布

阅读量816

点赞数

本文链接：https://blog.csdn.net/gwq5210/article/details/41076393

版权

uvaoj 同时被 2 个专栏收录

45 篇文章 0 订阅

订阅专栏

动态规划

27 篇文章 0 订阅

订阅专栏

357 - Let Me Count The Ways

也是求找钱的种类数,没有什么特别的地方,注意输出的格式.类似于 uvaoj 674 - Coin Change

代码如下:

/*************************************************************************
	> File Name: 357.cpp
	> Author: gwq
	> Mail: gwq5210@qq.com 
	> Created Time: 2014年11月13日 星期四 00时19分17秒
 ************************************************************************/

#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>

#define INF (INT_MAX / 10)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define pb push_back
#define sz(a) ((int)(a).size())

using namespace std;
typedef set<int> si;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;

const double esp = 1e-5;

#define N 30010

int cnt = 5;
int mp[] = {1, 5, 10, 25, 50};
ll dp[N][10], n, ans[N], res[N];

int main(int argc, char *argv[])
{
	//二维数组递推
	dp[0][0] = 1;
	for (int i = 1; i < N; ++i) {
		ans[i] = 0;
		for (int j = 0; j < cnt; ++j) {
			dp[i][j] = 0;
			if (i - mp[j] >= 0) {
				for (int k = 0; k <= j; ++k) {
					dp[i][j] += dp[i - mp[j]][k];
				}
			}
			ans[i] += dp[i][j];
		}
	}

	//一维滚动数组递推
	clr(res, 0);
	res[0] = 1;
	for (int i = 0; i < cnt; ++i) {
		for (int j = mp[i]; j < N; ++j) {
			res[j] += res[j - mp[i]];
		}
	}
	while (scanf("%lld", &n) != EOF) {
		//if (ans[n] > 1) {
		if (res[n] > 1) {
			//printf("There are %lld ways to produce %lld cents change.\n", ans[n], n);
			printf("There are %lld ways to produce %lld cents change.\n", res[n], n);
		} else {
			//printf("There is only 1 way to produce %lld cents change.\n", n);
			printf("There is only 1 way to produce %lld cents change.\n", n);
		}
	}

	return 0;
}

/*
Let Me Count The Ways 

After making a purchase at a large department store, Mel's change was 17
cents. He received 1 dime, 1 nickel, and 2 pennies. Later that day, he was
shopping at a convenience store. Again his change was 17 cents. This time
he received 2 nickels and 7 pennies. He began to wonder ' "How many stores
can I shop in and receive 17 cents change in a different configuration of
coins? After a suitable mental struggle, he decided the answer was 6. He then
challenged you to consider the general problem.

Write a program which will determine the number of different combinations of
US coins (penny: 1c, nickel: 5c, dime: 10c, quarter: 25c, half-dollar: 50c)
which may be used to produce a given amount of money.

Input
The input will consist of a set of numbers between 0 and 30000 inclusive,
one per line in the input file.

Output
The output will consist of the appropriate statement from the selection
below on a single line in the output file for each input value. The number
m is the number your program computes, n is the input value.

There are m ways to produce n cents change.
There is only 1 way to produce n cents change.

Sample input
17 
11
4

Sample output
There are 6 ways to produce 17 cents change. 
There are 4 ways to produce 11 cents change. 
There is only 1 way to produce 4 cents change.
*/