（水题）洛谷 - P1464 - Function

https://www.luogu.org/problemnew/show/P1464

#include<bits/stdc++.h>
using namespace std;
#define ll long long
 
ll a,b,c;
 
map<ll,int> m;
 
int dfs(ll a,ll b,ll c){
    if(a<=||b<=||c<=)
        return ;
    if(a>||b>||c>)
        return dfs(,,);
    ll p=*a+*b+c;
    if(m.count(p))
        return m[p];
    else if(a<b&&b<c){
        int t=dfs(a,b,c-)+dfs(a,b-,c-)-dfs(a,b-,c);;
        m[p]=t;
        return t;
    }
    else{
        int t=dfs(a-,b,c)+dfs(a-,b-,c)+dfs(a-,b,c-)-dfs(a-,b-,c-);
        m[p]=t;
        return t;
    }
}
 
int main(){
    while(cin>>a>>b>>c){
        if(a==-&&b==-&&c==-)
            return ;
        else{
            printf("w(%lld, %lld, %lld) = %d\n",a,b,c,dfs(a,b,c));
        }
    }
}