luogu 1028数的计算

#include<iostream>#include<cstdio>#include<cstring>using namespace std;long long int n;int i,j,k;int f[20000];int search(int t){int p=1;if(f[t]!=-1)return f[t];for(int i=1;i<=t/2;i++)p+=search(i);f[t]=p;return p;}int main(){cin>>n;memset(f,-1,sizeof f);cout<<search(n)<<endl;return 0;}