n-k集

#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<set>
#include<vector>
#include<cstring>
#include <algorithm>
#define LL long long
#define inf 0x7fffffff
#define E 1e-9
#define M 310
#define N 505
#define f(n,k) f[n+1][k+1]
using namespace std;
int n,h,m,e,t,k;
int f[N][N];
int fun(int n,int k)
{
    k<0?k=-1:0;
    if(f(n,k)==-1)
    {
        f(n,k)=fun(n-1,k)+fun(n-2,k-n);
    }
    return f(n,k);
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
    while(scanf("%d%d",&n,&k)!=EOF)
    {
    memset(f,-1,sizeof(f));
//        n--,k--;//无有!注意f(n,k)的意义！！！
        for(int i=0; i<=k; i++)
            f(-1,i)=0,f(0,i)=0;
        f(-1,-1)=1;
        f(0,-1)=1;

        cout<<"f(n,k)="<<fun(n,k)<<endl;

    }
    return 0;
}