Pagini recente » Cod sursa (job #1437949) | Cod sursa (job #87239) | Cod sursa (job #471290) | Cod sursa (job #2453235) | Cod sursa (job #1511043)
#include <bits/stdc++.h>
using namespace std;
bool c[100005];
int main()
{
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
int n, k;
cin >> n >> k;
int last = 1;
for(int i = 1; i <= n; i ++) {
int j = n - i - 1;
int nxt = j * (j + 1) / 2;
if(nxt >= k) {
cout << last << " ";
c[last] = true;
while(c[last])
last ++;
}
else {
int j = k - nxt;
int in = last;
while(j) {
if(!c[last])
j --;
last ++;
}
while(c[last])
last ++;
k = nxt;
cout << last << " ";
c[last] = true;
last = in;
}
}
cout << "\n";
return 0;
}