Cod sursa(job #2766612)
Utilizator | Data | 2 august 2021 15:16:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int v[20];
int n, k;
void bt(int cnt, int lst){
if(cnt > k){
for(int i=1; i<=k; i++)
fout<<v[i]<<" ";
fout<<"\n";
return;
}
for(int i=lst+1; i<=n; i++){
v[cnt]=i;
bt(cnt+1, i);
}
}
int main (){
fin>>n>>k;
bt(1, 0);
return 0;
}