Pagini recente » Borderou de evaluare (job #1951010) | Borderou de evaluare (job #3145026) | Borderou de evaluare (job #1677794) | Borderou de evaluare (job #135180) | Cod sursa (job #1235855)
#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;
for (i = N ; i > 0 ; i--)
if (i != q) printf("%d ", i + p - 1);
printf("%d\n", q + p - 1);
return 0;
}