Pagini recente » Cod sursa (job #680944) | Cod sursa (job #1500091) | Ceva interesant de văzut?:) | Cod sursa (job #106345) | Cod sursa (job #478946)
Cod sursa(job #478946)
#include<stdio.h>
long long int n,k,r,l,i,m,mm,p;
int main()
{
FILE *f,*g;
f=fopen("farfurii.in","r");
g=fopen("farfurii.out","w");
fscanf(f,"%lld%lld",&n,&k);
if(!k)
{ for(i=1;i<=n;i++)
fprintf(g,"%lld ",i);
fprintf(g,"\n");
fcloseall();
return 0;
}
for(i=0;i<=n;i++)
if((k<=i*(i+1)/2)&&(k>=i*(i-1)/2)){m=i;break;}
if(k<=m*(m-1)/2)
{
for(i=1;i<=n-m;i++)
fprintf(g,"%lld ",i);
for(i=n;i>=n-m+1;i--)
fprintf(g,"%lld ",i);
fprintf(g,"\n");
fcloseall();
return 0;
}
if(k==m*(m+1)/2)
{
for(i=1;i<=n-m-1;i++)
fprintf(g,"%lld ",i);
for(i=n;i>=n-m;i--)
fprintf(g,"%lld ",i);
fprintf(g,"\n");
fcloseall();
return 0;
}
for(i=1;i<=n-m-1;i++)
fprintf(g,"%lld ",i);
p=n-(m*(m+1)/2-k);
fprintf(g,"%lld ",p);
for(i=n;i>p;i--)
fprintf(g,"%lld ",i);
for(i=p-1;i>=n-m;i--)
fprintf(g,"%lld ",i);
fprintf(g,"\n");
fcloseall();
return 0;
}