Pagini recente » Cod sursa (job #2125607) | Cod sursa (job #2621442) | Cod sursa (job #3032917) | Cod sursa (job #2264279) | Cod sursa (job #1460904)
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int N, K, X, Y;
long long nr, i;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%d%d", &N, &K);
X = 8* K + 1;
X = (double)sqrt((double)X);
X = (X + 1)/2;
nr = 1LL * X * (X-1)/2;
Y = K - nr;
nr = N - X;
for ( i = 1; i <= nr - 1; i++)
printf("%lld ", i);
printf("%lld ", nr + Y);
for ( i = N; i > nr + Y; i--)
printf("%lld ", i);
//printf("%llu %llu\n",nr + Y, nr - 1);
long long a = nr + Y - 1;
for ( i = a; i >= nr; --i)
printf("%llu\n", i);
}