Pagini recente » Cod sursa (job #2646677) | Cod sursa (job #1398269) | Cod sursa (job #2940011) | Cod sursa (job #303) | Cod sursa (job #1327067)
#include <iostream>
#include <fstream>
using namespace std;
int v[100005], i, p, este, nrlor, ok, ceva, nr, n, k;
int main()
{ ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
cin>>n>>k;/*
nr=1;ceva=n;
while(1)
{ceva--;
if(ceva*(ceva+1)/2>k&&(ceva-1)*(ceva)/2>k)
v[++p]=nr,cout<<v[p]<<' ',nr++;
else
break;}
nr=n;
for(i=p+1; i<=n; i++)
v[i]=nr,nr--;
nrlor=ceva*(ceva+1)/2-k;
este=p+1+nrlor;
cout<<v[este]<<' ';
for(i=p+1; i<=n; i++)
if(i!=(p+1+nrlor))
cout<<v[i]<<' ';
*/
ok=n;
while(1)
{if(ok*(ok+1)/2>k&&(ok-1)*ok/2<k)
break;
else
ok--;}
ok++;
int vic, vic2;
vic=n-ok;
for(i=1; i<=vic; i++)
cout<<i<<' ';
vic2=vic+1;
ok--;
vic=ok*(ok+1)/2-k;
cout<<n-vic<<' ';
for(i=n; i>=vic2; i--)
if(i!=n-vic)
cout<<i<<' ';
return 0;
}