Pagini recente » Cod sursa (job #984757) | Cod sursa (job #257582) | Cod sursa (job #1497625) | Cod sursa (job #397882) | Cod sursa (job #165638)
Cod sursa(job #165638)
#include <stdio.h>
#define N 20
int n,k;
int pr[N];
void scan(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
}
void solve(){
int i,x,j,y,nr,s;
x=2<<n-1;
for (i=0;i<x;++i){
y=i;nr=n;s=0;
while (y){
--nr;
pr[nr]=y%2;
y/=2;
}
for (j=0;j<n;++j)
if (pr[j]==0)
++s;
if (s==k){
for (j=0;j<n;++j)
if (pr[j]==0)
printf("%d ",j+1);
printf("\n");
}
}
}
void std_close(){
fclose(stdin);
fclose(stdout);
}
int main(){
scan();
solve();
std_close();
return 0;
}