Coin sums Problem 31

Coin sums
Problem 31
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:

1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
It is possible to make £2 in the following way:

1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
How many different ways can £2 be made using any number of coins?

Answer:
73682

dp[m][n]表示对于m钱用前n种硬币可以有多少表示方法，那么考虑对于第n个币种拿1，2，3，，，，一直到m/money[n]个，将所有情况累加。

#include<bits/stdc++.h>
using namespace std;
#define maxn 205
long long money[9]={1,2,5,10,20,50,100,200};
long long dp[maxn][maxn];
int main()
{
    memset(dp,0,sizeof(dp));
    for(int i=0;i<=200;i++)
    dp[0][i]=1;
    for(int i=0;i<=200;i++)
        dp[i][0]=1;
    for(long long i=1;i<=200;i++)
    {
        for(long long j=1;j<=6;j++)
        {
            dp[i][j]=dp[i][j-1];
            for(long long z=1;;z++)
            {
            if(i-z*money[j]<0) break;
            dp[i][j]+=dp[i-z*money[j]][j-1];
            }
        }
    }
    cout<<dp[200][6]<<endl;
}