Pagini recente » Cod sursa (job #2629351) | Cod sursa (job #347124) | Cod sursa (job #621741) | Cod sursa (job #1864289) | Cod sursa (job #2769115)
#include <bits/stdc++.h>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
long long n,k,inv=1;
int main()
{
in>>n>>k;
while(inv*(inv+1)/2<=k)
inv++;
for(long long i=1; i<n-inv; i++)
out<<i<<" ";
long long inv_plus=n+k-inv*(inv+1)/2;
out<<inv_plus<<" ";
for(long long j=n; j>n-inv-1; j--)
if(j!=inv_plus)
out<<j<<" ";
return 0;
}