Cod sursa(job #2292553)
Utilizator | Data | 29 noiembrie 2018 17:55:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
#define LgMax 20
int n, lg;
int a[LgMax];
void bkt(int);
void afisare();
int main(){
fin >> n >> lg;
bkt(1);
}
void bkt(int k){
if(k == lg + 1) afisare();
else
for(int i = a[k - 1] + 1; i <= n - lg + k; i++){
a[k] = i;
bkt(k + 1);
}
}
void afisare(){
for(int i = 1; i <= lg; i++) fout << a[i] << ' ';
fout << '\n';
}