Pagini recente » Cod sursa (job #1111426) | Cod sursa (job #2588773) | Cod sursa (job #2870598) | Cod sursa (job #2265186) | Cod sursa (job #645222)
Cod sursa(job #645222)
#include<cstdio>
#include<iostream>
using namespace std;
void backtrack( int k, int p, int l, int s[], int a[], int len ){
int i;
if( l >= k ){
for( i=0; i<k-1; ++i ){
printf("%d ", s[i]);
}
printf("%d", s[i]);
printf("\n");
} else {
for( i=p+1; i<len; ++i ){
s[l] = a[i];
backtrack( k, i, l+1, s, a, len );
}
}
}
void combinations( int k, int a[], int len ){
int s[len];
backtrack( k, -1, 0, s, a, len );
}
int main(){
int i,a[20];
int k = 2;
int n = 4;
freopen( "combinari.in", "r", stdin );
freopen( "combinari.out", "w", stdout );
scanf("%d %d", &n, &k);
for( i=1; i<=n; ++i ){
a[i-1] = i;
}
combinations( k, a, n );
return 1;
}