Pagini recente » Cod sursa (job #1064623) | Cod sursa (job #3302340) | Cod sursa (job #1973740) | Cod sursa (job #2328940) | Cod sursa (job #3303568)
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int main() {
int N, K;
fin >> N >> K;
vector<int> select(N, 0);
for (int i = 0; i < K; i++) {
select[i] = 1;
}
sort(select.begin(), select.end());
do {
bool first = true;
for (int i = 0; i < N; i++) {
if (select[i] == 1) {
if (!first) fout << " ";
fout << i + 1;
first = false;
}
}
fout << "\n";
} while (next_permutation(select.begin(), select.end()));
fin.close();
fout.close();
return 0;
}