Pagini recente » Cod sursa (job #2340858) | Cod sursa (job #2648430) | Cod sursa (job #1266337) | Cod sursa (job #1677890) | Cod sursa (job #2752406)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("order.in");
ofstream fout("order.out");
int main()
{
int n, k, m, nr;
fin>>n>>k;
for(int i = 1; i <= n; i++)
{
m = n - i;
//m * (m - 1) / 2 e nr inv
if (m * (m - 1) / 2 < k) //ultimul nr crescator
{
nr = k - m * (m - 1) / 2 + i;
fout<<nr<<" ";
m = n - i + 1;
break;
}
fout<<i<<" "; //nr crescator
}
for (int i = 0; i < m; i++) //nr descrescator
if(n - i != nr)
fout<<n - i<<" ";
return 0;
}