Urkupillit

#include <iostream>

using namespace std;
using ll = long long;

int t[100100];

int main()
{
	int n;
	ll k;
	cin >> n >> k;
	int step = n-1;
	int x = n;
	int i = 0;
	while (k > step) {
		k -= step--;
		t[i++] = x--;
	}
	t[n-1 - k] = x;
	int c = 1;
	for (int i = 0; i < n; ++i) {
		if (t[i]) continue;
		t[i] = c++;
	}
	for (int i = 0; i < n; ++i)
		cout << t[i] << ' ';
	cout << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED