Pagini recente » Cod sursa (job #2457134) | Cod sursa (job #1087253) | Cod sursa (job #3152589) | Cod sursa (job #231467) | Cod sursa (job #165047)
Cod sursa(job #165047)
#include <stdio.h>
#include <math.h>
long long N, K, M;
int main()
{
long long P, num, L, L2;
int i;
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
scanf("%d %d", &N, &K);
M = sqrt(2 * N) + 1;
P = (M - 1) * M / 2;
if ( K == P)
{
for ( i = 1; i <= N - M; i++)
printf("%d ", i);
for ( i = N; i >= N - M + 1; i--)
printf("%d ", i);
}
else
{
L = N - M - 1;
L2 = N - M;
for ( i = 1; i <= L; i++)
printf("%d ", i);
num = N - ( M * ( M+1) / 2 - K);
printf("%d ", num);
for ( i = N; i > num; i--)
printf("%d ", i);
for ( i = num - 1; i >= L2; i--)
printf("%d ", i);
}
return 0;
}