Pagini recente » Cod sursa (job #2370213) | Cod sursa (job #277171) | Cod sursa (job #1603277) | Cod sursa (job #1320013) | Cod sursa (job #2306210)
#include<fstream>
#include<cmath>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int n,k,l,sol[100005];
int main(){
cin>>n>>k;
l=(1+sqrt(1+8*k))/2;
for(int i=n-l+1,j=n;i<=n;i++,j--)
sol[i]=j;
for(int i=1;i<=n-l;i++)
sol[i]=i;
for(int p=l*(l-1)/2+1,i=n;p<=k;p++,i--)
swap(sol[n-l],sol[i]);
for(int i=1;i<=n;i++)
cout<<sol[i]<<' ';
}