Pagini recente » Cod sursa (job #1657194) | Cod sursa (job #2366896) | Cod sursa (job #1650124) | Cod sursa (job #2529231) | Cod sursa (job #2384096)
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[20], b[20];
bool Sol(int x){
return x-1==k;
}
void back(int x){
if(Sol(x)){
for(int i =1 ; i<=k; i++) printf("%d ", a[i]);
printf("\n");
}
else{
for(int i = 1; i<=n; i++){
if(!b[i] && a[x-1]<i){
a[x] = i;
b[i] = 1;
back(x+1);
b[i] = 0;
}
}
}
}
int main(){
freopen("combinari.in","r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
back(1);
}