Pagini recente » Cod sursa (job #2446544) | Cod sursa (job #2058809) | Cod sursa (job #357074) | Cod sursa (job #2050198) | Cod sursa (job #1460178)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
const int Dim = 100001;
typedef long long ll;
ll N,K,Sol[Dim];
int main()
{
fin >> N >> K;
ll i = 1;
while(K > (1LL * (i + 1) * i / 2))
i++;
ll X = (N - ((1LL * (i + 1) * i / 2) - K));
for (int j = 1;j < N - i;j++)
fout << j << " ";
fout << X << " ";
for (int j = N;j >= N - i;j--)
if (j != X)
fout << j << " ";
return 0;
}