Pagini recente » Cod sursa (job #76204) | Cod sursa (job #60849) | Cod sursa (job #734986) | Cod sursa (job #2194666) | Cod sursa (job #1217505)
#include <cstdio>
#define i64 long long
using namespace std;
bool s[100005];
int main(void)
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
i64 n,k,x,i,N;
scanf("%d %d\n",&n,&k);
printf("%d %d\n",n,k);return 0;
x=n;
for (i=1;i<=n && k<(N=(x-1)*(x-2)/2);++i,--x) printf("%d ",i);
if (k-N+i>0) printf("%d ",k-N+i),s[k-N+i]=1;
for (i=1;i<=n;++i) if (!s[i]) printf("%d ",i),s[i]=1;
fclose(stdout);
}