Pagini recente » Cod sursa (job #1021102) | Cod sursa (job #2778089) | Cod sursa (job #666059) | Cod sursa (job #325358) | Cod sursa (job #3134387)
#include <iostream>
#include <string>
#include <vector>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
long long n, k, m = 0;
f >> n >> k;
//cin >> n >> k;
while (k >= (m * (m - 1) >> 1))
m++;
//cout << m << endl;
for (long long i = 1;i < n - m;i++)
g << i << " ";
long long repetition = n + k - (m * (m - 1) >> 1);
g << repetition << " ";
for (long long i = n;i >= n - m;i--)
{
if (i = !repetition)
{
g << i << " ";
}
}
/*if (k == ((m * (m + 1)) >> 1))
{
for (int i = 1;i <= n - m;i++)
{
g << i << " ";
//cout << i << " ";
}
for (int i = n;i >= (n + 1 - m);i--)
{
g << i << " ";
//cout << i << " ";
}
}
if (k < ((m * (m + 1)) >> 1))
{
for (int i = 1;i < n - m;i++)
{
g << i << " ";
//cout << i << " ";
}
int repetition= n - (((m * (m + 1)) >> 1) - k);
g << n - (((m * (m + 1)) >> 1) - k) << " ";
//cout << n - (((m * (m + 1)) >> 1) - k) << " ";
for (int i = n;i >= n - m;i--)
{
if (i != repetition)
{
g << i << " ";
//cout << i << " ";
}
}
}*/
return 0;
}