Cod sursa(job #2684216)
| Utilizator | Data | 13 decembrie 2020 11:01:06 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
#define MAX_K 18
FILE *fout;
int v[MAX_K + 1];
int n, k;
void comb( int pos ) {
int i;
if ( pos == k + 1 ) {
for ( i = 1; i <= k; i++ )
fprintf( fout, "%d ", v[i] );
fprintf( fout, "\n" );
} else {
for ( i = v[pos - 1] + 1; i <= n; i++ ) {
v[pos] = i;
comb( pos + 1 );
}
}
}
int main() {
FILE *fin;
fin = fopen( "combinari.in", "r" );
fscanf( fin, "%d%d", &n, &k );
fclose( fin );
fout = fopen( "combinari.out", "w" );
comb( 1 );
fclose( fout );
return 0;
}
