Pagini recente » Cod sursa (job #2359610) | Cod sursa (job #877987) | Cod sursa (job #774742) | Cod sursa (job #1404258) | Cod sursa (job #2628411)
//#include "pch.h"
#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <climits>
#include <queue>
#define ll long long int
#define nr 10005
using namespace std;
ifstream f("farfurii.in");
ofstream o("farfurii.out");
ll k, n, i = 1;
int main()
{
f >> n >> k;
while ((n - i)*(n - i - 1) / 2 > k)
{
o << i << " ";
i++;
}
ll aux = k - (n - i)*(n - i - 1) / 2 + i;
o << aux << " ";
for (int j = n; j > aux; j--)
o << j << " ";
for (int j = aux - 1; j >= i; j--)
o << j << " ";
}