Pagini recente » Cod sursa (job #2115790) | Cod sursa (job #323339) | Cod sursa (job #1561989) | Cod sursa (job #2315236) | Cod sursa (job #1469903)
#include <cstdio>
#include <cstdlib>
long long cit() {
long long ans = 0;
char c = getchar();
bool neg = false;
while (c < '0' || c > '9') {
if (c == '-') {
c = getchar();
neg = true;
break;
}
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = (ans << 3) + (ans << 1) + (c - '0');
c = getchar();
}
return (neg) ? -ans : ans;
}
void afis(long long n, char d) {
int l = 0;
char c[20];
if (n == 0) {
putchar('0');
}
if (n < 0) {
putchar('-');
n = -n;
}
while (n > 0) {
c[l++] = n % 10 + '0';
n /= 10;
}
for (int i = l - 1; i >= 0; i--) {
putchar(c[i]);
}
putchar(d);
}
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
long long n = cit(), k = cit(), st = 0, in = n;
while (true) {
long long p = n * (n - 1) / 2 - k;
if (p < n) {
afis(in - p, ' ');
for (int i = in; i > st; i--) {
if (i == in - p)
continue;
afis(i, ' ');
}
break;
} else {
st++;
afis(st, ' ');
n--;
}
}
return 0;
}