Pagini recente » Cod sursa (job #1773454) | Cod sursa (job #2579953) | Cod sursa (job #17838) | Cod sursa (job #1454664) | Cod sursa (job #1528204)
#include <iostream>
#include <fstream>
using namespace std;
int n,k;
int v[20];
FILE *f=fopen("combinari.out","w");
bool good(int l) {
return true;
}
bool sol(int l) {
return l==k;
}
void afisare() {
for(int i=1;i<=k;i++)
fprintf(f,"%d ",v[i]);
fprintf(f,"\n");
}
void BT(int l){
for(int i = v[l-1]+1; i <= n ; i++) {
v[l] = i;
//if (good(l)) {
if (sol(l)) {
afisare();
}
else BT(l+1);
//}
}
}
int main()
{
freopen("combinari.in","r",stdin);
scanf("%d %d", &n, &k);
v[0] = 0 ;
BT(1);
fclose(f);
fclose(stdin);
return 0;
}