Pagini recente » Cod sursa (job #3279369) | Cod sursa (job #3268773) | Cod sursa (job #3272708) | Cod sursa (job #1984683) | Cod sursa (job #3272062)
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, m, v[19];
bool ok(int k) {
for (int i = 1; i < k; ++i) {
if (v[i] == v[k]) return false;
if (k > 1 && v[k] <= v[k - 1]) return false;
}
return true;
}
bool sol(int k) {
return k == m;
}
void back(int k) {
for (int i = 1; i <= n; ++i) {
v[k] = i;
if (ok(k)) {
if (sol(k)) {
for (int j = 1; j <= m; ++j)
cout << v[j] << ' ';
cout << '\n';
}
else back(k + 1);
}
}
}
int main() {
cin.tie(0);
cin.sync_with_stdio(false);
cin >> n >> m;
back(1);
return 0;
}