Cod sursa(job #2904422)
Utilizator | Data | 17 mai 2022 23:35:48 | |
---|---|---|---|
Problema | Farfurii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("farfurii.in");
ofstream out("farfurii.out");
typedef long long int int64;
int64 n, k;
int main() {
int64 p, x;
in >> n >> k;
for (p = n; p > 1 && k > n - p; --p)
k -= (n - p);
for (int i = 1; i < p; ++i)
out << i << ' ';
x = p + k;
out << x << ' ';
for (int i = n; i >= p; --i)
if (i != x)
out << i << ' ';
return 0;
}