Pagini recente » Cod sursa (job #2033574) | Cod sursa (job #2582098) | Cod sursa (job #1319537) | Cod sursa (job #2635299) | Cod sursa (job #1327071)
#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;
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;
if(vic!=n)
cout<<n-vic<<' ';
for(i=n; i>=vic2; i--)
if(i!=n-vic)
cout<<i<<' ';
return 0;
}