Pagini recente » Cod sursa (job #3157384) | Cod sursa (job #2265698) | Cod sursa (job #2035187) | Cod sursa (job #1246711) | Cod sursa (job #2065283)
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int N, K, ok;
int rsp[NMAX];
int main()
{
fin >> N >> K;
int i = 1;
while ((N - i) * (N - i - 1) / 2 >= K && i <= N)
i++;
i--;
for (int j = 1; j <= i; j++)
rsp[j] = j;
int nr = (N - i) * (N - i - 1) / 2;
int j = i + 1;
while (nr > K)
{
nr--;
j++;
}
if (j != i + 1)
{
rsp[++i] = N - j + i;
ok = 1;
}
i++;
int cnt = 0;
while (i <= N)
{
rsp[i] = N - cnt;
if (i == j && ok == 1)
cnt++;
cnt++;
i++;
}
for (int i = 1; i <= N; i++)
fout << rsp[i] << " ";
return 0;
}