Cod sursa(job #2417997)
| Utilizator | Data | 2 mai 2019 17:59:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, l, v[19];
void bk(int k) {
if(k == l + 1) {
for(int i = 1; i <= l; i++)
fout << v[i] << " ";
fout << "\n";
}
for(int i = v[k - 1] + 1; i <= n; i++) {
v[k] = i;
bk(k + 1);
}
}
int main()
{
fin >> n >> l;
bk(1);
}
