Cod sursa(job #2408895)
Utilizator | Data | 18 aprilie 2019 14:06:29 | |
---|---|---|---|
Problema | Farfurii | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
bool b[100005];
int main()
{
int n, k;
fin >> n >> k;
long long s = 1LL * n * (n - 1) / 2;
for (int i = 0; i < n; i++)
{
if (s - (n - 1 - i) >= k)
{
fout << i + 1 << ' ';
s -= n - 1 - i;
b[i] = 1;
}
if (s == k)
break;
}
for (int i = n - 1; i >= 0; i--)
if (b[i] == 0)
fout << i + 1 << ' ';
fout << '\n';
return 0;
}