Pagini recente » Cod sursa (job #3208016) | Cod sursa (job #2670558) | Cod sursa (job #25397) | Cod sursa (job #1128105) | Cod sursa (job #1328280)
#include<cstdio>
using namespace std;
int k,n,i,p,x;
int main()
{
FILE *fin,*fout;
fin=fopen("farfurii.in","r");
fout=fopen("farfurii.out","w");
fscanf(fin,"%d%d",&n,&k);
while((p*(p+1))/2<k) p++;
for(i=1; i<=n-p; i++) fprintf(fout,"%d ",i);
if(p*(p-1)==2*k) for(i=n; i>=n-p+1; i--) fprintf(fout,"%d ",i);
else
{
x=(p*(p-1))/2-k+1;
fprintf(fout,"%d ",n-x+1);
x=n-x+1;
for(i=n; i>n-p; i--) if(i!=x) fprintf(fout,"%d ",i);
}
}