输入:所购买的3种鸡的总书目M
输出:满足问题的解的数目k,公鸡,母鸡,小鸡的数目:g[],m[],s[]
void chicken_problem(int n,int &k,int g[],int m[],int s[])
{
int i,j,a,b,c;
k = 0;
i = n/5;
j = n/3;
for (a = 0 ;a <= i; a++)
{
for (b = 0; b <= j; b++)
{
c = n-a-b;
if((5*a+3*b+c/3 ==n )&&(c%3==0))
{
g[k]=a;
m[k]=b;
s[k]=c;
k++;
}
}
}
}