Pagini recente » Cod sursa (job #1696521) | Cod sursa (job #700145) | Cod sursa (job #2951557) | Cod sursa (job #2435392) | Cod sursa (job #2907019)
#include <bits/stdc++.h>
using namespace std;
int N , K , P = 1;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> N >> K;
while (P * (P - 1) / 2 < K) ++P;
if(P * (P - 1) / 2 == K){
for(int i = 1;i <= N - P; ++i)
cout << i << " ";
for(int i = N;i > N - P; --i)
cout << i << " ";
}else{
// N => N - P
int nr = N - (P * (P-1) / 2 - K);
for(int i = 1;i <= N - P; ++i)
cout << i << " ";
cout << nr << " ";
for(int i = N;i > N - P; --i)
if(i != nr)
cout << i << " ";
}
}