Pagini recente » Cod sursa (job #1592764) | Cod sursa (job #2975664) | Cod sursa (job #3211540) | Cod sursa (job #3246918) | Cod sursa (job #2002890)
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("arbori.in");
ofstream so("arbori.out");
int m;
long long sol[95][15][95],res;
int aux(int a)
{
int z=a%m;
if(z<0)
z+=m;
return z;
}
int main()
{
int n,k2;
si>>n>>m>>k2;
for(int i=0;i<=n;i++)
sol[1][0][i]=1;
for(int i=2;i<=n;i++)
{
int x=aux(i-1);
sol[i][x][1]=1;
for(int j=2;j<=n;j++)
{
for(int k=0;k<m;k++)
{
res=1;
for(int l=0;l*j<i;l++)
{
sol[i][k][j]+=sol[i-j*l][aux(k-l)][j-1]*res;
res*=sol[j][aux(k2-1)][j-1]+l;
res/=(l+1);
}
}
}
}
so<<sol[n][k2][n-1]<<'\n';
return 0;
}