Pagini recente » Cod sursa (job #2807097) | Cod sursa (job #3124630) | Cod sursa (job #541189) | Cod sursa (job #2918117) | Cod sursa (job #2880019)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n,v[100001];
long long k;
vector<int> S;
void constr(int n, int k)
{
int pcrt=1;
while(pcrt<=n)
{
long long val=(n-pcrt)*(n-pcrt-1)/2;
if(k<=val)
{
v[pcrt]=*(S.begin());
S.erase(S.begin());
}
else
{
v[pcrt]=S[k-val];
S.erase(S.begin()+(k-val));
k-=k-val;
}
pcrt++;
}
}
int main()
{
fin >> n >> k;
for(int i=1;i<=n;i++) S.push_back(i);
constr(n,k);
for(int i=1;i<=n;i++)
fout << v[i] << " ";
return 0;
}