Pagini recente » Cod sursa (job #700822) | Cod sursa (job #679248) | Cod sursa (job #3001634) | Cod sursa (job #399886) | Cod sursa (job #206017)
Cod sursa(job #206017)
#include<stdio.h>
int n,k,s[10];
void afis(long k){
int i;
for(i=1;i<=k;++i)
printf("%d ",s[i]);
printf("\n");
}
void comb(int p){
int i;
if(p==k+1)
afis(k);
else
for(i=s[p-1]+1;i<=n-k+p;++i){
s[p]=i;
comb(p+1);
}
}
int main(){
int i;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)
s[i]=i;
comb(1);
fclose(stdin);
fclose(stdout);
return 0;
}