Pagini recente » Borderou de evaluare (job #183669) | Cod sursa (job #1115297) | Cod sursa (job #1784817) | Cod sursa (job #2229325) | Cod sursa (job #2623113)
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("farfurii.in", "r", stdin);
freopen("farfurii.out", "w", stdout);
int n,k;
scanf("%d%d", &n, &k);
long int N = (1+ sqrt(1 + 8*k) )/2+1, i;
long int K = N*(N - 1)/2;
for(i = 1; i<=(n - N);i++)
printf("%ld ",i);
int dif = (n - N);
printf("%ld ",n - (K - k));
N+=dif;
for(i = N; i > N - (K - k);i--)
printf("%ld ",i);
for(i = N - (K - k)-1; i>0;i--)
printf("%ld ",i);
return 0;
}