Pagini recente » Cod sursa (job #1019169) | Cod sursa (job #1462797) | Cod sursa (job #2372317) | Cod sursa (job #1458920) | Cod sursa (job #1472838)
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int N, X, Y, i, nr;
long long K;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d%lld", &N, &K);
for (X = 1; X * (X - 1)/2 <= K; ++X );
X--;
nr = X * (X-1)/2;
Y = K - nr;
nr = N - X;
for ( i = 1; i <= nr - 1; i++)
printf("%d ", i);
printf("%d ", nr + Y);
for ( i = N; i > nr + Y; i--)
printf("%d ", i);
int a = nr + Y - 1;
for ( i = a; i >= nr; --i)
printf("%d ", i);
}