Pagini recente » Cod sursa (job #1701781) | Cod sursa (job #2427401) | Cod sursa (job #2205830) | Cod sursa (job #1028040) | Cod sursa (job #3326812)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k, m, d, i, inv;
int main() {
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
fin >> n >> k;
inv = n * (n - 1) / 2;
m = 1;
while(inv > k) {
int cur = n - m;
if(inv - cur >= k) {
fout << m++ << " ";
inv -= cur;
}
else {
d = n - (inv - k);
fout << d << " ";
break;
}
}
for(i = n; i >= m; i--) {
if(i != d) fout << i << " ";
}
return 0;
}