Urkupillit

#include <bits/stdc++.h>

using namespace std;

int main(){
	cin.sync_with_stdio(false);
	int n=0, k=0, moved=1, sub=0;
	cin >> n >> k;

	vector<int> p;
	for (int i = 1; i <= n; i++){
		p.push_back(i);
	}

	for (int h=0; h < k; h++){
	if (moved == n-sub){moved = 1; sub++;}
	swap(p[p.size()-moved],p[p.size()-moved-1]);
	moved++;
	}

	for (int g = 0; g < n; g++){
		cout << p[g] << " ";
	}
	cout << "\n";
}

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: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED