Pagini recente » Cod sursa (job #315392) | Cod sursa (job #557830) | Cod sursa (job #1369899) | Cod sursa (job #1265505) | Cod sursa (job #2282251)
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
const int N=100000+5;
int n;
long long cnt,lft,x;
int vi;
int aib[N];
int main()
{
fin>>n>>cnt;
const int bs=(1<<16);
for(register int i=1;i<=n;i++)
{
lft=n-i;
x=lft*(lft-1)/2;
if(cnt<=x)
{
vi=0;
}
else
{
vi=cnt-x;
}
cnt-=vi;
vi++;
register int r=0,pas=bs;
register int now=0;
while(pas)
{
if(r+pas<=n && r+pas+now+aib[r+pas]<vi)
{
r+=pas;
now+=aib[r];
}
pas>>=1;
}
r++;
for(int j=r;j<=n;j+=j&(-j))
{
aib[j]--;
}
fout<<r<<" ";
}
fout<<"\n";
return 0;
}