Pagini recente » Cod sursa (job #2894842) | Cod sursa (job #527503) | Cod sursa (job #2753802) | Cod sursa (job #1853921) | Cod sursa (job #1064612)
#include<cstdio>
using namespace std;
long long N,K;
int main()
{
long long i,j,p,q;
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
scanf("%lld%lld",&N,&K);
for(i=1;i<=N;i++)
{
j=i*(i+1)/2;
if(j>K) break;
}
p=i-1;
q=K-1LL*p*(p+1)/2;
for(i=1;i<=N-p-2;i++)
printf("%lld ",i);
printf("%lld ",N-p+q-1);
for(i=N-p,j=N;i<=N;i++,j--)
{
if(j==N-p+q-1) j--;
printf("%lld ",j);
}
return 0;
}