Pagini recente » Cod sursa (job #1640494) | Cod sursa (job #1229059) | Cod sursa (job #421464) | Cod sursa (job #2095117) | Cod sursa (job #2902679)
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
ifstream in("farfurii.in");
ofstream out("farfurii.out");
vector<int> nrs;
long long n,k,inv;
in >> n >> k;
in.close();
inv = (n-1) * (n - 2) / 2;
int i = 1;
while(inv > k)
{
inv -= n - i - 1;
out << i << " ";
++i;
}
int nr = k - inv + i;
out << nr << " ";
int j = n;
while(j>i-1)
{
if (j != nr)
out << j << " ";
--j;
}
out.close();
return 0;
}