Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2)

#include <bits/stdc++.h>

typedef long long ll;

void solve() {
	int x, y, n; std::cin >> x >> y >> n;
	std::vector<int> a(n+1);
	a[1] = x; a[n] = y;
	for (int i = n - 1, cur = 1; i >= 2; --i, cur++) {
		a[i] = a[i + 1] - cur;
	}
	if (a[2] - a[1] >= n - 1) for (int i = 1; i <= n; i++) std::cout << a[i] << " \n"[i==n];
	else std::cout << -1 << '\n';
}

int main() {
	int _ = 1; std::cin >> _;
	while ( _-- ) { solve(); }
	return 0;
}

#include <bits/stdc++.h>

typedef long long ll;
char s[2000005], s_odd[2000005], s_even[2000005];
void solve() {
	int n, k; std::cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		std::cin >> s[i];
		if (i & 1) s_odd[(i+1)/2] = s[i];
		else s_even[i/2] = s[i];
	}
	std::string ans = "";
	if (k & 1) {
		std::sort(s_odd + 1, s_odd + (n+1)/2 + 1, [&](char a, char b){
			return a < b;
		});
		std::sort(s_even + 1, s_even + n/2 + 1, [&](char a, char b){
			return a < b;
		});
		for (int i = 1; i <= n/2; i++) ans += s_odd[i], ans += s_even[i];
		if (n&1) ans += s_odd[n/2+1];
	}
	else {
		if (k == n) {
			std::string ts1 = "", ts2 = "";
			
			std::sort(s_odd + 1, s_odd + (n+1)/2 + 1, [&](char a, char b){
				return a < b;
			});
			std::sort(s_even + 1, s_even + n/2 + 1, [&](char a, char b){
				return a < b;
			});
			for (int i = 1; i <= n/2; i++) ts1 += s_odd[i], ts1 += s_even[i];
			if (n&1) ans += s_odd[n/2+1];
			
			for (int i = n; i; --i) {
				int l = n - i + 1;
				if (l & 1) s_odd[(l+1)/2] = s[i];
				else s_even[l/2] = s[i];
			}
			
			std::sort(s_odd + 1, s_odd + (n+1)/2 + 1, [&](char a, char b){
				return a < b;
			});
			std::sort(s_even + 1, s_even + n/2 + 1, [&](char a, char b){
				return a < b;
			});
			for (int i = 1; i <= n/2; i++) ts2 += s_odd[i], ts2 += s_even[i];
			if (n&1) ans += s_odd[n/2+1];
			
			ans = std::min(ts1, ts2);
		}
		if (k < n) {
			std::sort(s + 1, s + n + 1, [&](char a, char b){
				return a < b;
			});
			for (int i = 1; i <= n; i++) ans += s[i];
		}
	}
	
	std::cout << ans << '\n';
}

int main() {
	int _ = 1; std::cin >> _;
	while ( _-- ) { solve(); }
	return 0;
}

#include <bits/stdc++.h>
typedef long long ll;
void solve() {
	int x; std::cin >> x;
	std::vector<int> ans(1, x);
	while ( __builtin_popcount(x) != 1 ) {
		x -= ( x & ( -x ) );
		ans.push_back(x);
	} 
	while (x != 1) {
		x >>= 1;
		ans.push_back(x);
	}
	int m = ans.size(); std::cout << m << '\n';
	for (int i = 0; i < m; i++) std::cout << ans[i] << " \n"[i==m-1];
}

int main() {
	int _ = 1; std::cin >> _;
	while ( _-- ) { solve(); }
	return 0;
}

#include <bits/stdc++.h>
typedef long long ll;
void solve() {
	int n; std::cin >> n;
	std::vector<std::vector<int> > a(n+1, std::vector<int>(n+1)), tag(n+1, std::vector<int>(n+1));
	
	for (int i = 1; i <= n; i++) {
		std::string s; std::cin >> s;
		for (int j = 1; j <= n; j++) {
			a[i][j] = (s[j - 1] - '0');
		}
	}
	
	auto settag = [&](int i, int j, int v) {
		tag[i][j] = ( tag[i][j] + v ) % 2;
	};
	
	auto pushdown = [&](int i, int j) {
		if (i + 1 <= n) { // 下一层存在 
			a[i + 1][j] = ( a[i + 1][j] + tag[i][j] ) % 2; // 更新中儿子信息 
			if (j - 1 >= 1) { // 标记压到左儿子，更新左右子信息 
				tag[i + 1][j - 1] = ( tag[i + 1][j - 1] + tag[i][j] ) % 2;
				a[i + 1][j - 1] = ( a[i + 1][j - 1] + tag[i][j] ) % 2;
			}
			if (j + 1 <= n) { // 标记压到右儿子，更新右儿子信息 
				tag[i + 1][j + 1] = ( tag[i + 1][j + 1] + tag[i][j] ) % 2;
				a[i + 1][j + 1] = ( a[i + 1][j + 1] + tag[i][j] ) % 2;
			}
		}
		if (i + 2 <= n && j - 1 >= 1 && j + 1 <= n) { // 中孙子在存在且左右儿子都存在则打上负标记 
			tag[i + 2][j] = ( tag[i + 2][j] - tag[i][j] + 2 ) % 2; 
			a[i + 2][j] = ( a[i + 2][j] - tag[i][j] + 2 ) % 2;
		}
		tag[i][j] = 0; // 压完标记清空 
	};
	
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (a[i][j]) ans++, settag(i, j, 1);
			pushdown(i, j);
		}
	}
	
	std::cout << ans << '\n';
}
int main() {
	int _ = 1; std::cin >> _;
	while ( _-- ) { solve(); }
	return 0;
}