Pagini recente » Cod sursa (job #2526842) | Cod sursa (job #312226) | Cod sursa (job #478502) | Cod sursa (job #636949) | Cod sursa (job #912582)
Cod sursa(job #912582)
#include <cstdio>
using namespace std;
int n;
int k;
int viz[20];
int a[20];
void afisare(){
for(int i = 1; i <= k; ++ i){
printf("%d ", a[i]);
}
printf("\n");
}
void back(int j){
if(j > k){
afisare();
return;
}
int m = n - k + j;
for(int i = a[j - 1] + 1; i <= m; ++ i){
if(viz[i] == 0){
viz[i] = 1;
a[j] = i;
back(j + 1);
viz[i] = 0;
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
back(1);
return 0;
}