C Language problem

Function Run Fun

problem:
We all love recursion! Don’t we?
Consider a three-parameter recursive function w(a, b, c):
if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:
1
if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:
w(20, 20, 20)
if a < b and b < c, then w(a, b, c) returns:
w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)
otherwise it returns:
w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)
This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.

Input:
The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.
Output:
Print the value for w(a,b,c) for each triple.

Sample Input:
1 1 1
2 2 2
10 4 6
50 50 50
-1 7 18
-1 -1 -1
Sample Output:
w(1, 1, 1) = 2
w(2, 2, 2) = 4
w(10, 4, 6) = 523
w(50, 50, 50) = 1048576
w(-1, 7, 18) = 1
Sponsor：
NO

#include<stdio.h>
#include<string.h>
int dp[25][25][25];
int main(){
    int x,y,z;
	
    init();
    while(scanf("%d%d%d",&x,&y,&z)!=EOF){
        if(x==-1&&y==-1&&z==-1)break;
        dp[20][20][20]=1048576;
        printf("w(%d, %d, %d) = %d\n",x,y,z,solve(x,y,z));
    }
    return 0;
    }

int fun(int a,int b,int c){
    if(a<=0||b<=0||c<=0)return 1;
    else return dp[a][b][c];
}
void init(){
	int i,j,k; 
    for(i=1;i<=20;i++){
        for(j=1;j<=20;j++){
            for(k=1;k<=20;k++){
                if(i<j&&j<k)
                    dp[i][j][k]=fun(i,j,k-1)+fun(i,j-1,k-1)-fun(i,j-1,k);
                else
                    dp[i][j][k]=fun(i-1,j,k)+fun(i-1,j-1,k)+fun(i-1,j,k-1)-fun(i-1,j-1,k-1);
            }
        }
    }
}
int solve(int a,int b,int c){
    if(a<=0||b<=0||c<=0)return 1;
    else if(a>20||b>20||c>20)return dp[20][20][20];
    else return dp[a][b][c];
}