Dollar Dayz POJ - 3181

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).

Input

A single line with two space-separated integers: N and 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

5

思路：

这个倒是没什么好说的，原本方法用01背包写，但是这里使可以无限使用的，需要用完全背包来结局，不过，要注意一下这是一道高精度的问题，小生也是看了一位大佬，才明白的，大佬写的在这个传送门。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
#define mv 2147483648+30
using namespace std;
ll gcd (ll x, ll y ){
	return x % y == 0 ? y : gcd(y , x%y);
}
int addition(int x[],int y[])//高精度加法
{
    for(int i = 0 ; i < 100 ; i ++)
    {
        y[i] + = x[i];
        if( y[i] > 9 )
        {
            y[i+1] ++;
            y[i] - = 10 ;
        }
    }
    return *y;
}
int main() {
	int n , m ;
	while(cin >> n >> m){
	
	int dp[2000][100];
	
		int  i , j ; mes( dp , 0 );
		
		dp[0][0] = 1;
		
		for( i = 1 ; i <= m ; i++ )
		
			for( j = i ; j <= n ; j ++)
			
			*dp[j] = addition( dp[j-i] , dp[j] );
			
		i = 100;
		
		while ( i ) {
		
			if( dp[n][i] ) break;
			
			i --;
		}
		while(i>=0){
		
			cout << dp[n][i] ; i --;
			
		}
		
		cout << endl;
	}
}