Pagini recente » Cod sursa (job #3185080) | Cod sursa (job #1667692) | Cod sursa (job #2215524) | Cod sursa (job #2868586) | Cod sursa (job #2755244)
#include<iostream>
#include<fstream>
using namespace std;
ifstream cit("farfurii.in");
ofstream afis("farfurii.out");
int main()
{
long long int n, k, nr, spec;
cit>>n>>k;
if(n == 1){
afis<<1;
}
else{
nr = 1;
while(nr*(nr + 1)/2 <= k){
nr++;
}
if(nr*(nr - 1)/2 == k){
for(int i = 1; i <= n - nr; i++){
afis<<i<<" ";
}
for(int i = n; i > n - nr; i--){
afis<<i<<" ";
}
}
else{
for(int i = 1; i < n - nr; i++){
afis<<i<<" ";
}
spec = n - nr + k - (nr*(nr - 1)/2);
afis<<spec<<" ";
for(int i = n; i >= n - nr; i--){
if(i != spec){
afis<<i<<" ";
}
}
}
}
return 0;
}