Pagini recente » Cod sursa (job #1333597) | Cod sursa (job #1972980) | Cod sursa (job #2195545) | Cod sursa (job #920533) | Cod sursa (job #2002819)
#include <cstdio>
using namespace std;
const int NMAX = 15;
int n, k, a[NMAX];
bool b[NMAX];
void bckt(int nr)
{
if(nr == k + 1) {
for(int i = 1;i <= k; ++i) {
printf("%d ", a[i]);
}
printf("\n");
}
else {
for(int i = a[nr - 1] + 1;i <= n; ++i) {
if(!b[i]) {
a[nr] = i;
b[i] = 1;
bckt(nr + 1);
b[i] = 0;
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &n, &k);
bckt(1);
return 0;
}