Pagini recente » Cod sursa (job #238741) | Cod sursa (job #2028035) | Cod sursa (job #3206385) | Cod sursa (job #2986569) | Cod sursa (job #2904369)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main()
{
long long n, k, i, contor = 1, a;
in >> n >> k;
while(contor * (contor + 1) <= k * 2)
contor++;
for(i = 1; i < n - contor; i++)
out << i << " ";
a = n - (contor * (contor + 1) / 2 - k);
out << a << " ";
for(i = n; n - contor <= i; i--)
if(i != a)
out << i << " ";
return 0;
}