【题目】
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).
【输入】
A single line with two space-separated integers: N and K.
【输出】
A single line with a single integer that is the number of unique ways FJ can spend his money.
【样例】
输入:
5 3
输出:
5
题目大意:给出两个数n和m,问在m以内的整数组成n的有多少种方法。
思路:
完全背包,但到后面的数会很大,参考学习别人的代码后,用将大数分开处理的方法AC了
假设F(N,M) 整数 N 的划分个数,其中 M 表示将 N 拆分后的序列中最大数
考虑边界状态:
M = 1 或者 N = 1 只有一个划分 既: F(1,1) = 1
M = N : 等于把M - 1 的划分数加 1 既: F(N,N) = F(N,N-1) + 1
M > N: 按理说,N 划分后的序列中最大数是不会超过 N 的,所以 F(N,M ) = F(N,N)
M < N: 这个是最常见的, 他应该是序列中最大数为 M-1 的划分和 N-M 的划分之和。
用动态规划来表示
dp[n][m]= dp[n][m-1]+ dp[n-m][m]
dp[n][m]表示整数 n 的划分中,每个数不大于 m 的划分数。
则划分数可以分为两种情况:
a. 划分中每个数都小于 m, 相当于每个数不大于 m- 1, 故
划分数为 dp[n][m-1].
b. 划分中有一个数为 m. 那就在 n中减去 m , 剩下的就相当
于把 n-m 进行划分, 故划分数为 dp[n-m][m];
代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include <algorithm>
using namespace std;
__int64 a[1005][105],b[1005][105],inf=1;
int main()
{
int n,m,k,i,j;
for(int i=0;i<18;i++)
inf*=10;
while(cin>>n>>m&&(n&&m))
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(i=0;i<=m;i++)
a[0][i]=1;
for(j=1;j<=m;j++)
{
for(i=1;i<=n;i++)
{
if(i<j)
{
a[i][j]=a[i][j-1];
b[i][j]=b[i][j-1];
continue;
}
b[i][j] = b[i-j][j]+b[i][j-1]+(a[i-j][j]+a[i][j-1])/inf;
a[i][j] = (a[i-j][j]+a[i][j-1])%inf;
}
}
if(b[n][m])
printf("%I64d",b[n][m]);
printf("%I64d\n",a[n][m]);
}
return 0;
}