Pagini recente » Cod sursa (job #2419309) | Cod sursa (job #368556) | Cod sursa (job #1614004) | Cod sursa (job #683439) | Cod sursa (job #1070119)
#include <cstdio>
using namespace std;
int N, K;
int v[100100];
int val[100100];
int next[100100];
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%d %d", &N, &K);
for (int i = 1; i < N; ++i) {
int K2 = (N - i) * (N - i - 1) / 2;
int al = 0;
if (K2 < K) al = K - K2, K -= al;
printf("%d ", i + al);
if (al) {
int p = N;
while (p > i) {
if (p != al + i) printf("%d ", p);
--p;
}
printf("%d\n", i);
return 0;
}
}
return 0;
}