Pagini recente » Cod sursa (job #1396913) | Cod sursa (job #1292185) | Cod sursa (job #921877) | Cod sursa (job #2629376) | Cod sursa (job #3134057)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
long long n, k, x, i;
int main()
{
fin >> n >> k;
x = 0;
while(x*(x-1)/2 <= k)
x ++;
for(i = 1; i <= (x*(x-1)/2-k); i++)
fout << i << " ";
if(x*(x-1)/2 > k)
fout << n - (x*(x-1)/2-k) << " ";
for(i = n; i > x*(x-1)/2-k; i--)
if(i != (n - (x*(x-1)/2-k)))
fout << i << " ";
fin.close();
fout.close();
return 0;
}