Pagini recente » Cod sursa (job #2410071) | Cod sursa (job #1869864) | Cod sursa (job #2964145) | Cod sursa (job #2092743) | Cod sursa (job #571841)
Cod sursa(job #571841)
#include <stdio.h>
int n,k;
FILE *f,*g;
int main(){
int i,m,p;
f=fopen("farfurii.in","r");
g=fopen("farfurii.out","w");
fscanf(f,"%d %d",&n,&k);
fclose(f);
p=1;
while (p<n) p*=2;
for (m=0;p>0;p/=2)
if (m+p<=n && (m+p) * (m+p-1) <=2*k)
m+=p;
k-=m*(m-1)/2;
if (!k)
{
for (i=1;i<=n-m;i++)
fprintf(g,"%d ",i);
for (i=n;i>n-m;i--)
fprintf(g,"%d ",i);
fputc('\n',g);
}
else
{
k=m-k; m++;
for (i=1;i<=n-m;i++)
fprintf(g,"%d ",i);
fprintf(g,"%d ",n-k);
for (i=n;i>n-k;i--)
fprintf(g,"%d ",i);
for (i=n-k-1;i>n-m;i--)
fprintf(g,"%d ",i);
fputc('\n',g);
}
fclose(g);
return 0;
}