Pagini recente » Cod sursa (job #375159) | Cod sursa (job #234061) | Cod sursa (job #1820552) | Cod sursa (job #1142087) | Cod sursa (job #2233582)
#include <cstdio>
using namespace std;
int main()
{
freopen("farfurii.in","r",stdin);
freopen("farfurii.out","w",stdout);
int n(0);
long long m(0);
scanf("%d %lld",&n,&m);
long long operatii(0);
long long operatii2(0);
if ((long long) n * (n - 1) / 2 != m)
for (int i = 1 ; i <= n ; i++)
{
operatii = (((long long) n - i + 1) * (n - i)) / 2;
operatii2 = (((long long) n - i) * (n - i - 1)) / 2;
if (operatii > m && operatii2 > m)
{
printf("%d ",i);
}
else
{
printf("%d ",(long long) m - operatii2 + i);
for (int j = n ; j >= i ; j--)
if (j != (long long) m - operatii2 + i)
printf("%d ",j);
i = n + 1;
}
}
else
for (int i = n ; i >= 1 ; i--)
printf("%d ",i);
return 0;
}