a myth

but was a myth

https://www.cnblogs.com/BadBadBad/p/18022844/cpp-games

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

const int maxn = 1e6 + 5;
const int mod = 1000000007;

long long dp[maxn];

int main() {
    
    int n;
    cin >> n;
    
    dp[1] = 1;
    for(int i = 2;i<=n;i++){
    	if(i % 2 == 1){
    		dp[i] = dp[i-1];
		}else{
			dp[i] = dp[i-1] + dp[i / 2];
		}
	}
	cout << dp[n] << endl;
    
    return 0;
}```