Pagini recente » Cod sursa (job #446657) | Cod sursa (job #163872) | Cod sursa (job #2210798) | Cod sursa (job #1778061) | Cod sursa (job #3251636)
#include <fstream>
using namespace std;
ifstream cin("arbori.in");
ofstream cout("arbori.out");
int n,m,p,i,j,k,l;
int NMAX=95,MMAX=15,KMAX=95;
long long dp[NMAX][MMAX][KMAX];
int main()
{
cin>>n>>m>>p;
for(i=0; i<n; i++)
dp[1][0][i]=1;
for(i=2; i<=n; i++)
dp[i][(i-1)%m][1]=1;
for(i=2;i<=n;i++)
for(k=2;k<=n-1;k++)
for(j=0;j<=m-1;j++)
{
long long cmb=1;
for(l=0;l*k<i;l++)
{
dp[i][j][k]+=cmb*dp[i-l*k][(j-l+(m<<10))%m][k-1];
cmb=cmb*(dp[k][(p-1+m)%m][k-1]+l)/(l+1);
}
}
cout<<dp[n][p][n-1]<<"\n";
return 0;
}