Pagini recente » Cod sursa (job #1901236) | Cod sursa (job #1459496) | Cod sursa (job #301500) | Cod sursa (job #1838974) | Cod sursa (job #2282226)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
typedef long long ll;
const int N=100000+5;
int n;
ll cnt;
int v[N];
int main()
{
set<int>s;
fin>>n>>cnt;
for(int i=1;i<=n;i++)
{
s.insert(i);
ll lft=n-i;
ll x=lft*(lft-1)/2;
if(cnt<=x)
{
v[i]=0;
}
else
{
v[i]=cnt-x;
}
cnt-=v[i];
}
for(int i=1;i<=n;i++)
{
auto it=s.begin();
advance(it,v[i]);
fout<<*it<<" ";
s.erase(*it);
}
fout<<"\n";
return 0;
}