Pagini recente » Cod sursa (job #2324152) | Cod sursa (job #1716551) | Cod sursa (job #3244394) | Cod sursa (job #3179213) | Cod sursa (job #183124)
Cod sursa(job #183124)
//farfurii v1.0
#include <stdio.h>
#include <math.h>
#define MAXN 100005
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
long long n=0,m=0,k=0,i,t;
double temp;
scanf("%lld%lld",&n,&k);
temp=8*k+1;
m= (long long) ceil( (sqrt(temp)-1)/2 );
if (m*(m-1)==k<<1)
{
printf("1");
for (i=2; i<=n-m; ++i)
printf(" %lld",i);
for (i=n; i>n-m; --i)
printf(" %lld",i);
printf("\n");
}
else
{
t= n-( (m+1)*m/2-k );
printf("1");
for (i=2; i<=n-m-1; ++i)
printf(" %lld",i);
printf(" %lld",t);
for (i=n; i>n-m-1; --i)
if (i!=t)
printf(" %lld",i);
printf("\n");
}
fclose(stdin);
fclose(stdout);
return 0;
}