Pagini recente » Cod sursa (job #1764277) | Cod sursa (job #2988760) | Cod sursa (job #1434180) | Cod sursa (job #2815668) | Cod sursa (job #1235860)
#include<cstdio>
using namespace std;
int N, K, i, p, q;
int main() {
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%d %d", &N, &K);
p = 1;
while ( (N-p) * (N-p-1) / 2 >= K ) { printf("%d ", p); p++; }
N = N - p + 1;
q = K - (N-1)*(N-2) / 2 + 1;
printf("%d ", q + p - 1);
for (i = N ; i > 0 ; i--)
if (i != q) printf("%d ", i + p - 1);
return 0;
}