Pagini recente » Cod sursa (job #361468) | Cod sursa (job #1539449) | Autentificare | Cod sursa (job #1131503) | Cod sursa (job #1191340)
//#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("farfurii.in");
ofstream cout("farfurii.out");
#define MAX 100010
bool a[MAX];
int main()
{
int n, k, x, i;
fin>>n>>k;
x=(int)sqrt(2*k);
x++;
for(i=1;i<=n-x;i++)
{
a[i]=1;
cout<<i<<" ";
}
int d=x*(x-1)/2;
a[n-d+k]=1;
cout<<n-(d-k)<<" ";
for(i=n;i>=1;i--)
{
if(!a[i])
cout<<i<<" ";
}
}