Pagini recente » Cod sursa (job #3364128) | Cod sursa (job #3362576) | Cod sursa (job #3364408) | Cod sursa (job #3360094) | Cod sursa (job #3364404)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
long long dp[100005];
vector<int>rez;
int main(){
int n,minr=1,x;
long long k;
cin>>n>>k;
dp[0]=0;
for(int i=1;i<=n;i++)
dp[i]=dp[i-1]+(i-1);
for (int m=n;m>=1;m--){
if(k<=dp[m-1]){
rez.push_back(minr);
minr++;
}
else{
x=minr+(k-dp[m-1]);
rez.push_back(x);
k=0;
for(int j=n;j>=minr;j--){
if(j!=x)
rez.push_back(j);
}
break;
}
}
for(int i=0;i<n;i++)
cout<<rez[i]<<" ";
cout<<'\n';
return 0;
}