Pagini recente » Cod sursa (job #2238988) | Cod sursa (job #2687286) | Cod sursa (job #1280553) | Cod sursa (job #216288) | Cod sursa (job #2130780)
#include <cstdio>
int main() {
freopen ("farfurii.in", "r", stdin);
freopen ("farfurii.out", "w", stdout);
int n, k;
scanf("%d%d", &n, &k);
int maxCresc = 1;
while (maxCresc * (maxCresc - 1) / 2 < k) {
maxCresc++;
}
int x = maxCresc * (maxCresc - 1) / 2;
for (int i = 1; i <= n - maxCresc; i++) {
printf("%d ", i);
}
printf("%d", n - x + k);
for (int i = n; i >= n - maxCresc + 1; i--) {
if (i == n - x + k)
continue;
printf(" %d", i);
}
printf("\n");
return 0;
}