Pagini recente » Cod sursa (job #25579) | Cod sursa (job #1606723) | Cod sursa (job #37750) | Cod sursa (job #369901) | Cod sursa (job #2300665)
#include <bits/stdc++.h>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
int n, k;
int main() {
in >> n >> k;
int p = 1;
for (int i = n; i > 0; i--)
if (i * (i - 1) / 2 >= k)
p = i;
for (int i = 1; i <= n - p; i++)
out << i << ' ';
if (p * (p - 1) / 2 == k) {
int cnt = n;
for (int i = n - p + 1; i <= n; i++)
out << cnt-- << ' ';
return 0;
}
int st = n - p + 1 + p * (p - 1) / 2 - k;
out << st << ' ';
int cnt = n;
for (int i = n - p + 2; i <= n; i++, cnt--)
if (cnt != st)
out << cnt << ' ';
else out << --cnt << ' ';
return 0;
}