Pagini recente » Borderou de evaluare (job #2572310) | Borderou de evaluare (job #992661) | Cod sursa (job #710879) | Borderou de evaluare (job #3247521) | Cod sursa (job #459487)
Cod sursa(job #459487)
#include <cstdio>
long long N, K, i;
int main()
{
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%lld %lld", &N, &K);
for (i = 1; i <= N && i * (i - 1) / 2 < K; i++);
for (int j = 1; j <= N - i; j++)
printf("%d ", j);
int k = N - (i * (i - 1) / 2 - K);
printf("%d ", k);
for (int j = N; j > N - i; j--)
if (j != k)
printf("%d ", j);
return 0;
}