Pagini recente » Cod sursa (job #1436952) | Cod sursa (job #2616520) | Cod sursa (job #1094305) | Cod sursa (job #1059622) | Cod sursa (job #121558)
Cod sursa(job #121558)
#include<stdio.h>
#include<iostream.h>
#include<math.h>
long long n,k,i,m,rad2; long double rad;
int caz1()
{m=(1+rad2)/2;
for(i=1;i<=n-m;i++) printf("%lld ",i);
for(i=n;i>n-m;i--) printf("%lld ",i);}
int caz2()
{m=(1+rad2)/2+1; long long elem;
for(i=1;i<=n-m;i++) printf("%lld ",i);
elem=abs(n-(m*(m-1)-k)); printf("%lld ",elem);
for(i=n;i>n-m;i--) if(i!=elem) printf("%lld ",i);}
main()
{freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%lld %lld",&n,&k);
rad=sqrt(1+8*k); rad2=rad;
if(rad==rad2) caz1();
else caz2();
}