Pagini recente » Cod sursa (job #1676507) | Cod sursa (job #2288952) | Cod sursa (job #3173105) | Cod sursa (job #3191001) | Cod sursa (job #3254353)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
k = (n - 1) * n / 2 - k;
int a[100001];
for (int i = 1; i <= n; ++i) {
a[i] = n - i + 1;
}
for (int i = 1; i < n && k > 0; ++i) {
for (int j = i + 1; j <= n && k > 0; ++j) {
swap(a[i], a[j]);
--k;
}
}
for (int i = 1; i <= n; ++i) {
cout << a[i] << ' ';
}
return 0;
}