Pagini recente » Cod sursa (job #384349) | Cod sursa (job #2206079) | Cod sursa (job #2611211) | Cod sursa (job #603029) | Cod sursa (job #1327730)
#include <iostream>
#include <fstream>
using namespace std;
long long i, ok, vic, nr, n, k;
int main()
{
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
cin>>n>>k;
ok=1;
while((n-ok)*(n-ok-1)/2>=k)
cout<<ok<<' ',ok++;
// else
// break;
//}
n=n-ok+1;
vic=k-(n-1)*(n-2)/2+1;
cout<<vic+ok-1<<' ';
for(i=n; i>0; i--)
if(i!=vic)
cout<<i+ok-1<<' ';
return 0;
}