按图示方法，给出N个点，求一共同拥有多少种组成方式

DP打表

#include "stdio.h"
#include "string.h"
int mod=1000000007;

__int64 dp[1010][1010],sum[1010];

int main()
{
    int i,j,k,Case,n;
    memset(dp,0,sizeof(dp));
    memset(sum,0,sizeof(sum));

    dp[1][1]=1;
    for (i=1;i<=1000;i++)
        for (j=1;j<=i;j++)
            for (k=j;k<=1000;k+=j)
            {
                if (i+k>1000) break;
                dp[i+k][k]+=dp[i][j]%mod;
            }

    for (i=1;i<=1000;i++)
        for (j=1;j<=i;j++)
        sum[i]+=dp[i][j]%mod;


    Case=1;
    while (scanf("%d",&n)!=EOF)
        printf("Case %d: %I64d\n",Case++,sum[n]%mod);
    return 0;

}