Pagini recente » Cod sursa (job #1241005) | Cod sursa (job #2106752) | Cod sursa (job #1505113) | Cod sursa (job #3263363) | Cod sursa (job #2147154)
#include <fstream>
//#include<iostream>
using namespace std;
int main()
{
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
long n, m=1, k, x;
cin>>n>>k;
while ((m*(m-1))/2<k)
{
m++;
}
x=(m*(m-1))/2-k;
for (int i=1;i<=n-m;++i)
{
cout<<i<<" ";
}
if (x>0)
{
cout<<n-x<<" ";
}
for (int i=n;i>=n-m+1;--i)
{
if (i!=n-x)
{
cout<<i<<" ";
}
else if (x==0)
{
cout<<i<<" ";
}
}
return 0;
}