Pagini recente » Cod sursa (job #1098919) | Cod sursa (job #1264826) | Cod sursa (job #1719360) | Cod sursa (job #831907) | Cod sursa (job #1576785)
# include <bits/stdc++.h>
using namespace std;
int n, k, i, j;
int main ()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d %d", &n, &k);
int Lmax = n * (n - 1) / 2, nr = 0;
bool OK;
for (i = 1; i <= n && !OK; ++i) {
nr += n - i;
if (k <= Lmax - nr) printf("%d ", i);
else {
printf("%d ", i + k - (Lmax - nr));
for (j = n; j >= i; --j)
if (j != i + k - (Lmax - nr)) printf("%d ", j);
OK = true;
}
}
printf("\n");
return 0;
}