Pagini recente » Cod sursa (job #1874663) | Cod sursa (job #1943340) | Cod sursa (job #1116531) | Cod sursa (job #1799968) | Cod sursa (job #2753324)
#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);
j=a+1;
if(k==(((j)*a)/2))
{
for(i=1;i<=n-(j);++i)
g<<i<<" ";
for(i=n;i>n-(j);--i)
g<<i<<" ";
}
else {
c=(a*(j))/2;
d=j;
if(c<k)
{c=((a+2)*(j))/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;
}