Pagini recente » Cod sursa (job #1335323) | Cod sursa (job #1172339) | Cod sursa (job #1090853) | Cod sursa (job #26476) | Cod sursa (job #2128745)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
const int Nmax = 100005;
int main()
{
int n, m, copie, rez = 0, nr = 0, x = 1;
vector<int> v(Nmax);
in >> n >> m;
copie = n + 1;
for (int i = 1; i <= m; i++)
if ((i * (i + 1)) / 2 > m)
{
x = i - 1;
rez = (x * (x + 1)) / 2;
break;
}
x++;
rez = m - rez;
for (int i = 1; i < n - x; i++)
out << i << ' ';
out << n - x + rez << ' ';
for (int i = n - x + 1; i < n; i++)
{
copie--;
if (copie == n - x + rez)
copie--;
out << copie << ' ';
}
out << n - x << ' ';
return 0;
}