Submission #2999576

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1000000007LL;
ll sum[30];
int main() {
	ll K, N;
	cin >> K >> N;
	if (K % 2 == 0) {
		cout << K / 2;
		for (int i = 0; i < N - 1; i++) cout << " " << K;
		cout << endl;
		return 0;
	}
	int k = 0;
	sum[0] = 1;
	ll t = 1;
	while (1) {
		t *= K;
		if (sum[k] + t > N) break;
		sum[k + 1] = sum[k] + t;
		k++;
	}
	sum[k + 1] = sum[k] + t;
	k++;
	int d = (K + 1) / 2;
	cout << d;
	int i;
	int offset = 0;
	for (i = 1; i < N; i++) {
		if (N - i - 1 <= k && sum[N - i - 1] / 2 <= offset) break;
		cout << " " << d;
		if ((N-i) % 2) offset++;
	}
	int idx = (sum[N - i] + 1) / 2 - offset;
	for (int j = N - i - 1; j >= 0; j--) {
		if (idx == 0) idx = sum[j];
		if (idx == 1) break;
		idx--;
		cout << " " << (idx + sum[j] - 1) / sum[j];
		idx %= sum[j];
	}
	cout << endl;
}

Submission Info

Judge Result