Pagini recente » Cod sursa (job #716477) | Cod sursa (job #130487) | Cod sursa (job #409300) | Cod sursa (job #1769168) | Cod sursa (job #2020034)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int main()
{
long long n, k;
in >> n >> k;
long long p = 1;
while(p * (p + 1) / 2 < k)
p++;
for(int i = 1; i < n - p; i++)
out << i << " ";
long long rest = n - p * (p + 1) / 2 + k;
out << rest << " ";
for(int i = n; i >= n - p; i--)
if(i != rest)
out << i << " ";
out << "\n";
return 0;
}