Lantern Line

#include <bits/stdc++.h>
using namespace std;
const int MN = 5e6+100;
int t[MN];
int dp[MN];
int f(int a, int b) {
	if(b < 0) return 0;
	if(a == 0) return 0;
	if(a == 1) {
		return min(1, b+1);
	}
	if(__builtin_popcount(a) == 1) {
		return min(b+1, a);
	}
	else {
		int q = 1<<(int)(log2((long double)a));
		int ans = 0;
		if(b <= q-1) {
			ans = f(a-q, b);
			return ans;
		}
		if(dp[a] != -1) {
			ans = dp[a-q];
		}
		else {
			dp[a-q] = f(a-q, q-1);
			ans += dp[a-q];
		}
		ans += f(a-q, b-q);
		return ans;
	}
}
int main() {
	for(int i = 0; i < MN; ++i) dp[i] = -1;
	int n;
	cin>>n;
	t[0] = 1;
	cout<<1<<' ';
	for(int i = 0; i < n-1; ++i) {
			cout<<f(i+2, n-i-2)<<' ';
//		cout<<f(i+2, n-i-2)<<endl;
	}
	cout<<'\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED