Cod sursa(job #3306112)
| Utilizator | Data | 7 august 2025 16:53:50 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
const int NMAX = 1e5;
long long n, k;
int main()
{
int i;
in >> n >> k;
for(i = 1; (n - 1 - i) * (n - i) / 2 >= k; ++i)
{
out << i << ' ';
}
--i;
long long nr = (n - 1 - i) * (n - i) / 2 - k;
out << n - nr << ' ';
for(int j = n; j > i; --j)
{
if(j != n - nr)
{
out << j << ' ';
}
}
return 0;
}
