Pagini recente » Cod sursa (job #1041579) | Cod sursa (job #1293139) | Cod sursa (job #3160280) | Cod sursa (job #1605532) | Cod sursa (job #19897)
Cod sursa(job #19897)
#include <iostream>
#include <stdio.h>
using namespace std;
long long n,m;
long long i,j;
bool pus[200001];
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%lld %lld\n", &n, &m);
for ( i = 2; i <= n; i ++)
{
printf("%lld ",i-1);
pus[i-1]=1;
if ( ((n-i)*(n-i-1))/2 <= m ) break;
}
j=i-1;
i=(long long ) i + m-( (n-i)*(n-i-1) )/2 ;
printf("%lld ", i );
pus[i]=1;
for ( i = n; i>=j ; i-- )
if ( !pus[i] ) printf("%lld ", i);
printf("\n");
fclose(stdin);
fclose(stdout);
return 0;
}