USACO 1.4.4 Mother's Milk

/*
ID: tgh7281
LANG: C++
TASK: milk3
*/
 
#include <iostream>
#include <fstream>
using namespace std;
 
void search(int ma,int mc);
bool res[21]={0};
bool status[21][21]={0}; //status[i][j]表示A有i牛奶，C有j牛奶的可能
int a,b,c,p,q;
 
int main()
{
    ifstream fin("milk3.in");
    ofstream fout("milk3.out");
 
    int s=0,i,j=0;
    fin>>a>>b>>c;
    search(0,c);
 
    for (i=0;i<=20;i++) if (res[i]) s++;
    for (i=0;i<=20;i++)
    {
        if (res[i])
        {
            fout<<i;
            j++;
            if (j==s) fout<<endl;
            else fout<<’ ‘;
        }
    }
 
    fin.close();
 
    fout.close();
 
    return 0;
}
 
void search(int ma,int mc)
{
    if (status[ma][mc]) return;
 
    int mb=c-ma-mc;
    status[ma][mc]=true;
    if (ma==0) res[mc]=true;
 
    search(ma-min(ma,b-mb),mc); //a->b
    search(ma-min(ma,c-mc),mc+min(ma,c-mc)); //a->c
    search(ma+min(mb,a-ma),mc); //b->a
    search(ma,mc+min(mb,c-mc)); //b->c
    search(ma+min(a-ma,mc),mc-min(a-ma,mc)); //c->a ma + min(mc,a-ma),
    search(ma,mc-min(b-mb,mc)); //c->b
}