Pagini recente » Rating liangyuqi (yezang77) | Cod sursa (job #3334766) | Cod sursa (job #3330136) | Cod sursa (job #3338505) | Cod sursa (job #3343646)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int main()
{
long long n, k, nr = 1, i, d;
fin >> n >> k;
fin.close();
while(nr * (nr - 1) / 2 < k)
++nr;
for(i = 1; i <= n - nr; ++i)
fout << i << " ";
if(nr * (nr - 1) / 2 == k)
for(i = n; i > n - nr; i--)
fout << i << " ";
else
{
d = nr * (nr - 1) / 2 - k;
fout << n - d << " ";
for(i = n; i > n - nr; i --)
if(i != n - d)
fout << i << " ";
}
fout.close();
return 0;
}