Codeforces Round #514 (Div. 2) C - Sequence Transformation

推规律

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int maxn = 1e3+5;
int n, m, k; 

int main()
{
	scanf("%d", &n);
	int cnt = 0, ans = n, d = 1, sum = 0;
	while (n) { 
		if (n == 3) {
			printf("%d %d %d\n", d, d, d*3);
			return 0;
		}
		cnt = (n + 1) / 2;
		for (int i = 0; i < cnt; i ++) {
			printf("%d ", d);
		}
		n -= cnt;
		d *= 2;
	}
	printf("\n");
}