Cod sursa(job #2850018)
Utilizator | Data | 16 februarie 2022 09:37:01 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int i, j, n, st, dr, mid, k, poz, c, x[25], m;
int backtrack(int pas){
if(pas==k+1){
for(int i=1;i<=k;i++)
cout<<x[i]<<" ";
cout<<"\n";
}
else{
for(int i=x[pas-1]+1;i<=n;i++){
x[pas]=i;
backtrack(pas+1);
}
}
}
int main(){
cin>>n>>k;
backtrack(1);
}