Pagini recente » Cod sursa (job #1284592) | Cod sursa (job #1960635) | Cod sursa (job #316928) | Cod sursa (job #1132180) | Cod sursa (job #2040150)
#include <fstream>
using namespace std;
int v[20], n, k, fr[20];
ifstream cin ("combinari.in");
ofstream cout ("combinari.out");
void display() {
for (int i = 1; i <= k - 1; i++) {
if (v[i + 1] <= v[i])
return;
}
for (int i = 1; i <= k; i++)
cout << v[i] << " ";
cout << "\n";
}
void backtr(int p) {
if (p == k + 1) {
display();
return;
}
for (int i = 1; i <= n; i++) {
if (fr[i] == 0) {
fr[i] = 1;
v[p] = i;
backtr(p + 1);
fr[i] = 0;
}
}
}
int main() {
cin >> n >> k;
backtr(1);
return 0;
}