Pagini recente » Cod sursa (job #520837) | Cod sursa (job #3120938) | Cod sursa (job #2675481) | Cod sursa (job #1864352) | Cod sursa (job #2753322)
#include <iostream>
#include<cmath>
#include<fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
int n,k,a,b,c,d,i;
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;
}