Pagini recente » Cod sursa (job #630556) | Cod sursa (job #2504029) | Cod sursa (job #450193) | Cod sursa (job #755415) | Cod sursa (job #2880004)
#include <fstream>
#include <set>
#include <iostream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n,k,v[100001];
set<int> S;
void constr(int n, int k)
{
int pcrt=1;
while(pcrt<=n)
{
int val=(n-pcrt)*(n-pcrt-1)/2;
if(k<=val)
{
v[pcrt]=*(S.begin());
}
else
{
set<int>::iterator it=S.begin();
for(int j=1;j<k-val+1;j++)
++it;
v[pcrt]=*it;
k-=k-val;
}
S.erase(v[pcrt]);
pcrt++;
}
}
int main()
{
fin >> n >> k;
for(int i=1;i<=n;i++) S.insert(i);
constr(n,k);
for(int i=1;i<=n;i++)
fout << v[i] << " ";
return 0;
}