Cod sursa(job #3133642)
| Utilizator | Data | 26 mai 2023 14:48:51 | |
|---|---|---|---|
| Problema | Farfurii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> permutari(int f, int t) {
vector<int> p(f);
for (int i = 0; i < f; i++) {
p[i] = i + 1;
}
while (t > 0) {
next_permutation(p.begin(), p.end());
t--;
}
return p;
}
int main() {
ifstream fin("../farfurii.in");
ofstream fout("../farfurii.out");
int f, t;
fin >> f >> t;
vector<int> p = permutari(f, t);
for (int nr : p) {
fout << nr << " ";
}
fin.close();
fout.close();
return 0;
}
