Pagini recente » Cod sursa (job #2647623) | Cod sursa (job #2642797) | Cod sursa (job #435220) | Cod sursa (job #494178) | Cod sursa (job #2542601)
#include <bits/stdc++.h>
#define nmax 15005
#define ll long long
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
ll n,k;
void read(){
in >> n >> k;
}
ll fnd_n(){
ll x = sqrt(2*k);
while(x*(x-1)/2<=k) x++;
while(x*(x-1)/2>k) x--;
return x;
}
void solve(){
ll nr = fnd_n();
ll r = k-nr*(nr-1)/2;
if(r==0){
for(ll i=1; i<=n-nr; i++){
out<< i << ' ';
}
for(ll i=n-nr+1; i<=n; i++){
out << n-i+n-nr+1 << ' ';
}
}
else{
for(ll i=1; i<n-nr; i++){
out << i << ' ';
}
out << n-nr+r << ' ';
for(ll i=0; i<nr-r; i++){
out << n-i << ' ';
}
for(ll i=r-1; i>=0; i--){
out << n-nr+i << ' ';
}
}
}
int main(){
read();
solve();
}