Pagini recente » Cod sursa (job #2854365) | Cod sursa (job #232442) | Cod sursa (job #358353) | Cod sursa (job #1791120) | Cod sursa (job #1892890)
#include <bits/stdc++.h>
using namespace std;
int v[20],n,k;
bool check[20];
void bkt(int p){
if(p==k+1){
for(int i=1;i<=k;i++) printf("%d ",v[i]);
printf("\n");
}
else{
for(int i=v[p-1]+1;i<=n;i++){
if(check[i]==0){
check[i]=1;
v[p]=i;
bkt(p+1);
check[i]=0;
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}