Cod sursa(job #2859306)
Utilizator | Data | 1 martie 2022 10:03:06 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
#include <climits>
#include <stack>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
int n, k, p = 0, d;
f >> n >> k;
while (p*(p+1)/2 < k)
{
p++;
}
for (int i = 1; i < n - p; i++)
{
g << i << " ";
}
d = p * (p + 1) / 2 - k;
g << n - d << " ";
d = n - d;
for (int i = n; i >= n - p; i--)
{
if (i != d)
g << i << " ";
}
return 0;
}