Pagini recente » Cod sursa (job #2938689) | Cod sursa (job #1950080) | Cod sursa (job #895731) | Cod sursa (job #1910845) | Cod sursa (job #3223780)
#include <fstream>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int main()
{
long long n,k,i,m=0,x;
cin>>n>>k;
for(i=1;i<=n;i++)
if(i*(i-1)/2>=k && m==0)
m=i;
x=m*(m-1)/2-k;
for(int i=1;i<=n-m;i++)
cout<<i<<" ";
if(x==0)
{
for(int i=n;i>=n-m+1;i--)
cout<<i<<" ";
}
else
{
cout<<n-x<<" ";
for(int i=n;i>=n-m+1;i--)
if(i!=n-x)
cout<<i<<" ";
}
return 0;
}