Cod sursa(job #1844343)
| Utilizator | Data | 9 ianuarie 2017 22:19:59 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
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 << endl;
} else {
combinari(q + 1);
}
}
}
int main(int argc, const char * argv[]) {
ifstream cin("combinari.in");
ofstream cout("combinari.out");
cin >> n >> k;
combinari();
return 0;
}
