Cod sursa(job #1885234)
| Utilizator | Data | 19 februarie 2017 19:09:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, v[25];
bool check (int level) {
for (int i=1; i < level; i++) {
if (v[i] >= v[level]) return 0;
}
return 1;
}
void bkt (int level) {
for (int i=level; i <= n; i++) {
v[level] = i;
if (check(level)) {
if (level != k) bkt(level+1);
else {
for (int j=1; j<=k; j++) fout << v[j] << ' ';
fout << '\n';
}
}
}
}
int main()
{
fin >> n >> k;
bkt(1);
return 0;
}
