Pagini recente » Cod sursa (job #1908901) | Cod sursa (job #2970265) | Cod sursa (job #647164) | Cod sursa (job #484333) | Cod sursa (job #3134348)
#include <iostream>
#include <string>
#include <vector>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
int main()
{
int n, k, m = 0;
f >> n >> k;
while (k > (m * (m - 1) >> 1))
m++;
if (k == ((m * (m - 1)) >> 1))
{
for (int i = 1;i <= n - m;i++)
g << i << " ";
for (int i = n;i >= (n + 1 - m);i--)
g << i << " ";
}
if (k > ((m * (m - 1)) >> 1))
{
for (int i = 1;i < n - m;i++)
g << i << " ";
for (int i = n;i >= n - m;i--)
g << i << " ";
}
return 0;
}