Pagini recente » Cod sursa (job #1784435) | Cod sursa (job #1185659) | Cod sursa (job #3290524) | Cod sursa (job #1637560) | Cod sursa (job #1045838)
#include <stdio.h>
using namespace std;
FILE *f,*g;
int x,n,i,m;
long long k;
int main()
{f=fopen ("farfurii.in","r");
g=fopen ("farfurii.out","w");
fscanf (f,"%d%d",&n,&k);
m=1;
while (m*(m+1)/2<=k) m++;
for (i=1;i<n-m;i++)
fprintf (g,"%d ",i);
x=k-(m-1)*m/2;
fprintf (g,"%d ",m+x-1);
for (i=n;i>=n-m;i--)
if (i!=m+x-1) fprintf (g,"%d ",i);
return 0;
}