Pagini recente » Cod sursa (job #1220119) | Cod sursa (job #3181091) | Cod sursa (job #172999) | Cod sursa (job #2939741) | Cod sursa (job #2753327)
#include <iostream>
#include<cmath>
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,a,b,c,d,i;
int main()
{
f>>n>>k;
a=sqrt(2*k);
if(k==(((a+1)*a)/2))
{
for(i=1;i<=n-(a+1);++i)
g<<i<<" ";
for(i=n;i>n-(a+1);--i)
g<<i<<" ";
}
else {
c=(a*(a+1))/2;
d=a+1;
if(c<k)
{c=((a+2)*(a+1))/2;
d=a+2;}
b=c-k;
for(i=1;i<=n-d;++i)
g<<i<<" ";
g<<n-b<<" ";
for(i=n;i>n-d;--i)
if(i!=n-b)
g<<i<<" ";
}
return 0;
}