Pagini recente » Cod sursa (job #282070) | Cod sursa (job #1267783) | Cod sursa (job #2733797) | Cod sursa (job #2193323) | Cod sursa (job #624437)
Cod sursa(job #624437)
#include <stdio.h>
int x[20],n,k;
bool check(){
int v=0;
for(int i=1;i<=n;i++)if(x[i])v++;
if(v==k)return true;
return false;
}
void comb(){
int i;
while(x[n+1]==0){
i=1;
while(x[i])x[i++]=0;
x[i]=1;
if(check()){
for(i=1;i<=n;i++)
if(x[i])printf("%d ",i);
printf("\n"); } }
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
comb();
}