Pagini recente » Cod sursa (job #2644689) | Cod sursa (job #2292797) | Cod sursa (job #1205659) | Cod sursa (job #492547) | Cod sursa (job #2128734)
#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;
while (rez <= m)
{
rez = rez + x;
x++;
}
x--;
rez = rez - 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;
}