Cod sursa(job #3037566)
Utilizator | Data | 25 martie 2023 20:03:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int x[25];
int i, j, n, m, st, dr, mid, pas, k;
void backtrack(int pas){
if(pas==k+1){
for(int i=1;i<=k;i++)
cout<<x[i]<<" ";
cout<<"\n";
return;
}
for(int i=x[pas-1]+1;i<=n;i++){
x[pas]=i;
backtrack(pas+1);
}
}
int main(){
cin>>n>>k;
backtrack(1);
}