Pagini recente » Cod sursa (job #1943781) | Cod sursa (job #209473) | Borderou de evaluare (job #2968520) | Cod sursa (job #2282411) | Cod sursa (job #1070120)
#include <cstdio>
using namespace std;
typedef long long LL;
LL N, K;
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%d %lld", &N, &K);
for (int i = 1; i < N; ++i) {
LL K2 = (N - i) * (N - i - 1) / 2;
LL al = 0;
if (K2 < K) al = K - K2, K -= al;
printf("%d ", i + al);
if (al) {
LL p = N;
while (p > i) {
if (p != al + i) printf("%d ", p);
--p;
}
printf("%d\n", i);
return 0;
}
}
return 0;
}