整数拆分 hdu 4651 hdu 4658

hdu 4651 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4651

把数n拆成几个数（小于等于n）相加的形式 问有多少种拆法

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>

#define MEM(a,x) memset(a,x,sizeof a)
#define eps 1e-8
#define MOD 1000000007
#define MAXN 100010
#define MAXM 100010
#define INF 99999999
#define ll __int64
#define bug cout<<"here"<<endl
#define fread freopen("ceshi.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)

using namespace std;

int Read()
{
    char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    int x = 0;
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

void Print(int a)
{
     if(a>9)
         Print(a/10);
     putchar(a%10+'0');
}

int dp[MAXN];
void init()
{
    MEM(dp,0);
    dp[0]=1;
    for(int i=1;i<=100000;i++)
    {
        for(int j=1,r=1;i-(3*j*j-j)/2>=0;j++,r*=-1)
        {
            dp[i]+=dp[i-(3*j*j-j)/2]*r;
            dp[i]%=MOD;
            dp[i]=(dp[i]+MOD)%MOD;
            if(i-(3*j*j+j)/2>=0)
            {
                dp[i]+=dp[i-(3*j*j+j)/2]*r;
                dp[i]%=MOD;
                dp[i]=(dp[i]+MOD)%MOD;
            }
        }
    }
}

int main()
{
    //fread;
    init();
    int tc;
    scanf("%d",&tc);
    while(tc--)
    {
        int n;
        scanf("%d",&n);
        printf("%d\n",dp[n]);
    }
    return 0;
}

hdu 4658 题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=4658

题目跟上一题一样  但是多了一个要求 相同的数重复不能超过k个

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <string>
#include <vector>
#include <queue>

#define MEM(a,x) memset(a,x,sizeof a)
#define eps 1e-8
#define MOD 1000000007
#define MAXN 100010
#define MAXM 100010
#define INF 99999999
#define ll __int64
#define bug cout<<"here"<<endl
#define fread freopen("ceshi.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)

using namespace std;

int Read()
{
    char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    int x = 0;
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

void Print(int a)
{
     if(a>9)
         Print(a/10);
     putchar(a%10+'0');
}

int dp[MAXN];
void init()
{
    MEM(dp,0);
    dp[0]=1;
    for(int i=1;i<=100000;i++)
    {
        for(int j=1,r=1;i-(3*j*j-j)/2>=0;j++,r*=-1)
        {
            dp[i]+=dp[i-(3*j*j-j)/2]*r;
            dp[i]%=MOD;
            dp[i]=(dp[i]+MOD)%MOD;
            if(i-(3*j*j+j)/2>=0)
            {
                dp[i]+=dp[i-(3*j*j+j)/2]*r;
                dp[i]%=MOD;
                dp[i]=(dp[i]+MOD)%MOD;
            }
        }
    }
}

int solve(int n,int k)
{
    int ans=dp[n];
    for(int j=1,r=-1;n-k*(3*j*j-j)/2>=0;j++,r*=-1)
    {
        ans+=dp[n-k*(3*j*j-j)/2]*r;
        ans%=MOD;
        ans=(ans+MOD)%MOD;
        if(n-k*(3*j*j+j)/2>=0)
        {
            ans+=dp[n-k*(3*j*j+j)/2]*r;
            ans%=MOD;
            ans=(ans+MOD)%MOD;
        }
    }
    return ans;
}

int main()
{
    //fread;
    init();
    int tc;
    scanf("%d",&tc);
    while(tc--)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        int ans=solve(n,k);
        printf("%d\n",ans);
    }
    return 0;
}