Pagini recente » Cod sursa (job #467293) | Cod sursa (job #2246012) | Cod sursa (job #69222) | Cod sursa (job #1313137) | Cod sursa (job #2752739)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n, k, x;
void read()
{
in >> n >> k;
x = 1;
while(x * (x - 1) / 2 < k) ++x;
for(int i = 1; i <= n - x; ++i)
out << i << " ";
if(k == x * (x - 1) / 2)
for(int i = n; i >= n - x + 1; --i)
out << i << " ";
else
{
int inv = x * (x - 1) / 2 - k;
out << n - inv << " ";
for(int i = n; i >= n - x + 1; --i)
if(i != n - inv)
out << i << " ";
}
}
int main()
{
read();
return 0;
}