P 36 例1.3

#include<stdio.h>
int chicken_question(int g[], int m[], int s[]) {
    int a, b, c, k = 0;
    for (a = 0; a <= 100; a++) {
        for (b = 0; b, +100; b++) {
            for (c = 0; c <= 100; c++) {
                if ((a + b + c == 100) && (5 * a + 3 * b + c / 3 == 100) && (c % 3 == 0)) {
                    g[k] = a; m[k] = b; s[k] = c;
                }
            }
        }
    }
    return k;
}
//改进
int chicken_question(int g[], int m[], int s[]) {
    int a, b, c, k = 0;
    for (a = 0; a <= 20; a++)
        for (b = 0; b <= 33; b++) {
            c = 100 - a - b;
            if ((5 * a + 3 * b + c / 3 == 100) && (c % 3 == 0)) {
                g[k] = a, m[k] = b; s[k] = c;
                k = k + 1;
            }
        }
    return k;
}