简单递归换递推。

//这是递归
#include<iostream>
using namespace std;

int f(int n) {
    if(n==0 || n==1) return 1;
    return f(n-2) + f(n/2);
}

int main() {
    int n;
    cin >> n;
    cout << f(n) << endl;
    return 0;
}

//这是递推
#include<iostream>
using namespace std;

int f[1005]={1,1};
int main() {
    int n;
    cin >> n;
    for (int i = 2; i <= n; ++ i) {
        if (i - 2 >= 0)    f[i] += f[i - 2];
        if (i/2 > 0)    f[i] += f[i/2];
    }
    cout << f[n] << endl;
    return 0;
}