Pagini recente » Cod sursa (job #1601079) | Cod sursa (job #1102384) | Cod sursa (job #2858766) | Cod sursa (job #2013473) | Cod sursa (job #1883798)
#include<stdio.h>
using namespace std;
FILE *f1 = fopen("farfurii.in", "r");
FILE *f2 = fopen("farfurii.out", "w");
int N, K, i, M, val;
int main()
{
fscanf(f1, "%d%d", &N, &K);
fclose(f1);
M = 2;
while (M * (M-1) / 2 < K) M++;
if (M*(M-1)/2 == K)
{
for (i = 1; i <= N - M; i++)
fprintf(f2, "%d ", i);
for (i = N; i >= N - M + 1; i--)
fprintf(f2, "%d ", i);
return 0;
} else M--;
for (i = 1; i <= N-M-1; i++)
fprintf(f2, "%d ", i);
val = N-(K-M*(M-1)/2);
fprintf(f2, "%d ", val);
for (i = N; i >= N-M; i--)
if (i != val)
fprintf(f2, "%d ", i);
fclose(f2);
return 0;
}