BZOJ　1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店完全背包

最新推荐文章于 2020-12-08 16:08:25 发布

BlackJack_

最新推荐文章于 2020-12-08 16:08:25 发布

阅读量627

点赞数

分类专栏： —————————dp —————————Usaco 背包dp

本文链接：https://blog.csdn.net/BlackJack_/article/details/62051951

版权

—————————dp 同时被 3 个专栏收录

100 篇文章 0 订阅

订阅专栏

—————————Usaco

33 篇文章 0 订阅

订阅专栏

背包dp

11 篇文章 0 订阅

订阅专栏

[Usaco2006 Jan] Dollar Dayz 奶牛商店

Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 498 Solved: 265
[Submit][Status][Discuss]

Description

Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer John has exactly $5 to spend. He can buy 5 tools at $1 each or 1 tool at $3 and an additional 1 tool at $2. Of course, there are other combinations for a total of 5 different ways FJ can spend all his money on tools. Here they are: 1 @ US$3 + 1 @ US$2 1 @ US$3 + 2 @ US$1 1 @ US$2 + 3 @ US$1 2 @ US$2 + 1 @ US$1 5 @ US$1 Write a program than will compute the number of ways FJ can spend N dollars (1 <= N <= 1000) at The Cow Store for tools on sale with a cost of $1..$K (1 <= K <= 100).

约翰到奶牛商场里买工具．商场里有K(1≤K≤100).种工具，价格分别为1，2，…，K美元．约翰手里有N(1≤N≤1000)美元，必须花完．那他有多少种购买的组合呢？

Input

A single line with two space-separated integers: N and K.

仅一行，输入N，K.

Output

A single line with a single integer that is the number of unique ways FJ can spend his money.

不同的购买组合数．

Sample Input

5 3

Sample Output

水水更健康

完全背包（我才不会粘代码）

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#define inf 1000000000
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,k;
int f[1005][45];
void cal(int x,int y)
{
	for(int i=1;i<=40;i++)
		f[x][i]+=f[y][i];
	for(int i=1;i<=40;i++)
	{
		f[x][i+1]+=f[x][i]/10;
		f[x][i]%=10;
	}
}
int main()
{
	n=read();k=read();
	f[0][1]=1;
    	for(int i=1;i<=k;i++)
	for(int j=i;j<=n;j++)
	cal(j,j-i);
	int t=40;
	while(f[n][t]==0)t--;
	for(int i=t;i;i--)printf("%d",f[n][i]);
	return 0;
}