Pagini recente » Cod sursa (job #2374452) | Cod sursa (job #759376) | Cod sursa (job #2510585) | Cod sursa (job #775501) | Cod sursa (job #2623082)
#include<bits/stdc++.h>
using namespace std;
int main(){
ifstream cin("farfurii.in");
ofstream cout("farfurii.out");
int n,k;
cin >> n>>k;
int N = floor(1.0*(1+ sqrt(1 + 8*k) )/2);
if(N*(N - 1)/2 < k)
N++;
int K = N*(N - 1)/2;
for(int i = 1; i<=(n - N);i++)
cout << i<< ' ';
int dif = (n - N);
cout << N - (K - k) + dif<<' ';
for(int i = N; i > N - (K - k);i--)
cout << i + dif <<' ';
for(int i = N - (K - k)-1; i>0;i--)
cout<<i + dif<<' ';
return 0;
}