Pagini recente » Cod sursa (job #2800465) | Cod sursa (job #2945214) | Cod sursa (job #1569624) | Cod sursa (job #3257838) | Cod sursa (job #3040058)
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
const int NMAX=1e5+5;
int v[NMAX];
int main()
{
int n,k,i;
cin>>n>>k;
for(i=0;i<=1e5;i++)
{
v[i]=i*(i-1)/2;
}
for(i=1;i<=n;i++)
{
if(v[n-i]<=k)
{
break;
}
cout<<i<<" ";
}
cout<<i+k-v[n-i]<<" ";
for(int j=n;j>=i;j--)
{
if(j!=i+k-v[n-i])
{
cout<<j<<" ";
}
}
return 0;
}