Pagini recente » clasament-teme | ONIS 2015, Solutii Runda 1 | Cod sursa (job #2746247) | Cod sursa (job #1754853) | Cod sursa (job #2684650)
#include <bits/stdc++.h>
using namespace std;
#define MAXN 8
FILE *fout=fopen("combinari.out", "w");
int v[MAXN+1]={0, 1, 2, 3, 4, 5, 6, 7, 8};
int n, k;
void bkt(int pos){
if (pos==k+1){
for (int i=1; i<=k; i++){
fprintf(fout, "%d ", v[i]);
}
fprintf(fout, "\n");
}else{
for (int i=v[pos-1]+1; i<=n; i++){
v[pos]=i;
bkt(pos+1);
}
}
}
int main()
{
FILE *fin;
fin=fopen("combinari.in", "r");
fscanf(fin, "%d%d", &n, &k);
bkt(1);
return 0;
}