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