Cod sursa(job #1828356)
Utilizator | Popescu Vlad Druffbaum | Data | 13 decembrie 2016 10:03:00 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
FILE *fin, *fout;
int a[20], n, k;
void bkt( int m ) {
int i;
if ( k == m ) {
for ( i = 1; i <= k; i++ )
fprintf( fout, "%d ", a[i] );
fprintf( fout, "\n" );
}
else {
for ( i = a[m] + 1; i <= n; i++ ) {
a[m+1] = i;
bkt( m + 1 );
}
}
}
int main() {
fin = fopen( "combinari.in", "r" );
fscanf( fin, "%d %d", &n, &k );
fclose( fin );
fout = fopen( "combinari.out", "w" );
bkt( 0 );
fclose( fout );
return 0;
}