Submission #2554332

---

Source Code Expand

#include <cstdio>
using namespace std;

const int N = 3e5 + 10;
int n, K, top, a[N];

template <class T> inline void in(T &x) {
	x = 0; int f = 1; char ch = getchar();
	for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();}
	for (; ch>='0' && ch<='9';) x = x*10 + ch-'0', ch = getchar();
	x *= f;
}

int main() {
	in(K), in(n);
	if (K & 1) {
		top = n;
		for (int i = 1; i <= n; ++i) a[i] = K + 1 >> 1;
		for (int i = 1; i <= n/2; ++i)
			if (a[top] == 1) --a[top];
			else {
				--a[top];
				for (int j = top + 1; j <= n; ++top) a[j] = K;
				top = n;
			}
	} else {
		a[1] = K >> 1;
		for (int i = 2; i <= n; ++i) a[i] = K;
	}
	for (int i = 1; i < n; ++i) printf("%d ", a[i]); printf("%d\n", a[n]);
	return 0;
}

Submission Info

Judge Result