Cod sursa(job #3134396)
| Utilizator | Data | 28 mai 2023 22:50:30 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#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, repetition = 0;
f >> n >> k;
while (k > (m * (m - 1) >> 1))
m++;
for (long long i = 1;i <= n - m;i++)
g << i << " ";
if (k < m)
{
repetition = n + k - (m * (m - 1) >> 1);
g << repetition << " ";
}
for (long long i = n;i > n - m;i--)
{
if (i = !repetition)
{
g << i << " ";
}
}
return 0;
}