Cod sursa(job #1844353)
| Utilizator | Data | 9 ianuarie 2017 22:27:06 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 19;
int n, k, st[MAXN];
void combinari(int q = 1) {
for (int i = q; i <= n; ++i) {
st[q] = i;
if (q >= 2 && st[q] <= st[q - 1]) {
continue;
}
if (q == k) {
for (int i = 1; i <= k; ++i) {
cout << st[i] << ' ';
}
cout << '\n';
} else {
combinari(q + 1);
}
}
}
int main(int argc, const char * argv[]) {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
cin >> n >> k;
combinari();
return 0;
}
