Cod sursa(job #3195183)
Utilizator | Data | 20 ianuarie 2024 11:04:38 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream ci("combinari.in");
ofstream cou("combinari.out");
int n,k,x[20];
void afis(){
for(int i=1;i<=k;i++){
cou<<x[i]<<" ";
}
cou<<'\n';
}
void back(int pas){
for(int i=x[pas-1]+1;i<=n;i++){
x[pas]=i;
if(pas<k){
back(pas+1);
}
else{
afis();
}
}
}
int main(){
ci>>n>>k;
back(1);
return 0;
}