Pagini recente » Cod sursa (job #1913308) | Cod sursa (job #427198) | Cod sursa (job #1763939) | Cod sursa (job #241954) | Cod sursa (job #1701661)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n,k,i,l,kk;
ll ff;
int gasesc(ll k)
{
k*=2;
int f=sqrt(k)+1;
while((ll)f*(f-1)>k)f--;
return f;
}
int main()
{
fin>>n>>ff;
k=gasesc(ff);
if((ll)k*(k-1)/2==ff)
{
for(i=1;i<=n-k;i++)fout<<i<<" ";
for(i=n;i>n-k;i--)fout<<i<<" ";
fout<<"\n";
return 0;
}
ff-=(ll)k*(k-1)/2;
l=ff;
for(i=1;i<=n-k-1;i++)fout<<i<<" ";
kk=i+l;
fout<<kk<<" ";
for(i=n;i>=n-k;i--)
if(i!=kk)fout<<i<<" ";
fout<<"\n";
return 0;
}