Pagini recente » Cod sursa (job #923936) | Cod sursa (job #2557885) | Cod sursa (job #2263361) | Cod sursa (job #272420) | Cod sursa (job #1483655)
#include <stdio.h>
int tab[20];
int n,k;
FILE* fout;
void print() {
int i;
for(i=0; i<k-1; i++) {
fprintf(fout, "%d ", tab[i]);
}
fprintf(fout, "%d\n", tab[k-1]);
}
void combinari(int pos, int val) {
if(pos == k) {
print();
return;
}
if(k - pos > n - val) {
return;
}
int i;
for(i=val+1; i<=n; i++) {
tab[pos] = i;
combinari(pos+1, i);
}
tab[pos] = 0;
return;
}
int main() {
FILE* fin = fopen("combinari.in", "r");
fscanf(fin, "%d %d\n", &n, &k);
fclose(fin);
fout = fopen("combinari.out", "w");
combinari(0,0);
fclose(fout);
return 0;
}