Pagini recente » Cod sursa (job #2088981) | Cod sursa (job #2397599) | Cod sursa (job #2106565) | Cod sursa (job #1071007) | Cod sursa (job #2134742)
#include <cstdio>
using namespace std;
int used[100002];
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
int n,m,i,j;
scanf("%d%d",&n,&m);
for(i=n; i>=1&&i*(i-1)/2>=m; i--);
i++;
for(j=1; j<=n-i; j++)
{
printf("%d ",j);
used[j]=1;
}
m-=(i-1)*(i-2)/2;
printf("%d ",j+m);
used[j+m]=1;
for(i=n; i>=1; i--)
if(!used[i])
printf("%d ",i);
return 0;
}