# bzoj 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店（高精度完全背包）

## 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店

Time Limit: 5 Sec   Memory Limit: 64 MB
Submit: 599   Solved: 306
[ 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.

不同的购买组合数．

5 3

## Sample Output

5

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef struct Bnum
{
int l;
int s;
Bnum()
{
l = 0;
memset(s, 0, sizeof(s));
}
}Bnum;
Bnum operator + (Bnum x, Bnum y)
{
int i;
Bnum z;
z.l = max(x.l, y.l);
for(i=1;i<=z.l;i++)
{
z.s[i] += x.s[i]+y.s[i];
if(z.s[i]>999999999)
{
z.s[i+1] += 1;
z.s[i] -= 1000000000;
}
}
while(z.s[z.l+1])
z.l++;
return z;
}
void Print(Bnum x)
{
int i;
for(i=x.l;i>=1;i--)
printf("%d", x.s[i]);
printf("\n");
}
Bnum dp;
int main(void)
{
int i, n, j, k;
scanf("%d%d", &k, &n);
for(i=1;i<=k;i++)
dp[i].l = dp[i].s = 0;
dp.l = dp.s = 1;
for(i=1;i<=n;i++)
{
for(j=i;j<=k;j++)
dp[j] = dp[j]+dp[j-i];
}
Print(dp[k]);
return 0;
}

11-13 201                                                                          08-07 497
04-10 542
05-14 64
09-21 227
07-22 30
03-14 460
10-19 209
05-09 18
11-30 32
11-14 398
10-16 23
10-13 25
09-10 21
06-11 271
12-18 94
09-07 70
©️2020 CSDN 皮肤主题: 编程工作室 设计师:CSDN官方博客