Cod sursa(job #176798)
Utilizator | Data | 11 aprilie 2008 18:20:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#define NX 20
int N, K, st[ NX ];
int baga( int k ) {
int i;
if( k > K ) {
for( i = 1; i <= K; i++ )
printf( "%d ", st[i] );
printf( "\n" );
return 0;
}
for( i = st[k-1] + 1; i <= N - (K-k); i++ ) {
st[k] = i;
baga( k+1 );
}
return 0; //keeps compiler happy
}
int main() {
freopen( "combinari.in", "r", stdin );
freopen( "combinari.out", "w", stdout );
scanf( "%d%d", &N, &K );
baga( 1 );
return 0;
}