Pagini recente » Cod sursa (job #1349439) | Cod sursa (job #2863826) | Cod sursa (job #1427451) | Cod sursa (job #195698) | Cod sursa (job #3175263)
#include <bits/stdc++.h>
//#define int long long
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20];
void show(int k) {
for (int i(1); i <= k; i++) {
out << v[i] << ' ';
}
out << '\n';
}
bool verif(int k) {
for (int i(1); i <= k; i++) {
for (int j(i + 1); j <= k; j++) {
if (v[i] == v[j])return false;
}
}
return true;
}
void back(int x, int n, int k) {
for (int i(v[x - 1] + 1); i <= n; i++) {
v[x] = i;
if (x == k) {
if (verif(k))show(k);
} else {
back(x + 1, n, k);
}
}
}
signed main() {
int n, k;
in >> n >> k;
v[0] = 0;
back(1, n, k);
return 0;
}