UVa 10721 - Bar Codes

//\\__ hr1212 __//\\

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mi;

#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b)
#define siii(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pi(a) printf("%lld\n",a)
#define nl printf("\n");
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define f(i,a,b) for(i=a;i<b;i++)
#define rf(i,a,b) for(i=a;i>=b;i--)
#define clr(x,a) memset(x,a,sizeof(x))
#define MAX 1000100
#define MOD 1000000007

ll l,z,n,m,dp[60][60][60];

ll solve(ll n,ll m,ll k){
    if(n==0 && m==0){
        return 1;
    }
    if(m<=0 || k<=0 || n<=0 || (m==0 && k==0))
        return 0;
    if(dp[n][m][k]!=-1)
        return dp[n][m][k];

    return dp[n][m][k]=solve(n-1,m,k-1)+solve(n-1,m-1,z);
}

int main(){
    ll r,k,i,c=0,x=0,y=0,j,t,x1=0,y1=0;
    ll ans=0;string p;

    while(siii(n,m,z)!=EOF){
        clr(dp,-1);
        pi(solve(n,m,z));
    }

    return 0;
}