POJ 3014 Cake Pieces and Plates---整數劃分
Posted on 2009-08-24 20:14 Uriel 閱讀(254) 評論(0) 編輯 收藏 引用 所屬分類: POJ
/**//*Problem: 3014 User: Uriel
Memory: 68100K Time: 4657MS
Language: GCC Result: Accepted*/ 
#include<stdio.h>
int i,j,m,n,dp[4600][4600],k;
int main()

{
scanf("%d %d",&m,&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(i==1 || j==1)dp[i][j]=1;
else if(i<j)
{
for(k=j;k<=m;k++)
{
dp[i][k]=dp[i][i];
break;
}
}
else if(i==j)dp[i][j]=(dp[i][j-1]%1000000007+1)%1000000007;
else
dp[i][j]=(dp[i][j-1]%1000000007+dp[i-j][j]%1000000007)%1000000007;
}
}
printf("%d\n",dp[n][m]);
return 0;
}


