为啥案例没问题但过不了啊

using namespace std;
#define digui_(a,b,c) (w[a][b][c] ? w[a][b][c]:digui(a,b,c)) 
int w[25][25][25]; 
int digui(int a,int b,int c)
{
    if(a<=0||b<=0||c<=0) return 1;
    if(a>20||b>20||c>20) return digui_(20,20,20);
    if(a<b&&b<c) return digui_(a,b,c-1)+digui_(a,b-1,c-1)-digui_(a,b-1,c);
    return digui_(a-1,b,c)+digui_(a-1,b-1,c)+digui_(a-1,b,c-1)-digui_(a-1,b-1,c-1);
}
int main()
{
    int a,b,c;
    while(1)
    {
        cin>>a>>b>>c;
        if(a==-1&&b==-1&&c==-1) break;
    printf("w(%d,%d,%d)=%d",a,b,c,digui_(a,b,c));
    }

}