Pagini recente » Cod sursa (job #2071740) | Istoria paginii runda/22_februarie_simulare_oji_2024_clasa_9/clasament | Solutii Summer Challenge, Runda 2 | Istoria paginii runda/cls11_10febr/clasament | Cod sursa (job #2904549)
#include <fstream>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
int n, k, desc = 0;
f >> n >> k ;
while(desc*(desc + 1) / 2 < k)
desc++;
for(int asc = 1; asc < n - desc; asc++)
g << asc << " ";
int complement = n + k - desc * (desc + 1)/2;
g << complement << " ";
for(int rest = n; n - desc <= rest; rest--)
if(rest != complement)
g << rest << " ";
return 0;
}