Pagini recente » Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #1789597) | Cod sursa (job #530391) | Cod sursa (job #2128361)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
ll n,m,k,aux,i,p;
scanf("%lld%lld",&n,&m);
aux=m*2;
for (k=1;k<=n;k++) if (k*(k-1)>aux) break;
k--;
p=n-k-1;
for (i=1;i<=p;i++) printf("%lld ",i);
k=k*(k-1)/2;
aux=m-k+p+1;
printf("%lld ",aux);
for (i=n;i>p;i--)
if (i!=aux) printf("%lld ",i);
return 0;
}