UVa 357 - Let Me Count The Ways 背包
2013-04-29 16:30
477 查看
Let Me Count The Ways |
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 theinput 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.
-----------------------
还是背包
----------------------
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int coins[6]={1,5,10,25,50}; long long f[51111]; int m; int main() { memset(f,0,sizeof(f)); f[0]=1; for (int i=0;i<5;i++) { for (int j=0;j<=30000-coins[i];j++) { if (f[j]) f[j+coins[i]]+=f[j]; } } while (~scanf("%d",&m)) { if (f[m]==1) { printf("There is only 1 way to produce %d cents change.\n",m); } else { printf("There are %lld ways to produce %d cents change.\n",f[m],m); } } return 0; }
Let Me Count The Ways |
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 theinput 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.
相关文章推荐
- 【解题报告】uva357_Let Me Count The Ways(让我来数数方案, dp, 完全背包)
- UVA 357 Let Me Count The Ways(完全背包)
- UVa 357 Let Me Count The Ways (完全背包)
- UVA 357 Let Me Count The Ways(全然背包)
- UVA - 357 Let Me Count The Ways(完全背包)
- UVA 357 Let Me Count The Ways 完全背包
- UVa 357 - Let Me Count The Ways 背包
- UVA 357 Let Me Count The Ways (dp + 完全背包)
- UVA 357 - Let Me Count The Ways
- UVa 357 - Let Me Count The Ways
- UVA 357 - Let Me Count The Ways
- uva357 Let Me Count The Ways
- uva 357 - Let Me Count The Ways
- uva 357 - Let Me Count The Ways
- UVa 357 - Let Me Count The Ways
- UVA 357 Let me count the ways
- UVA 357 - Let Me Count The Ways
- uva 357 Let Me Count The Ways
- UVa 357 - Let Me Count The Ways
- uva 357 Let Me Count The Ways (DP)