Pagini recente » Cod sursa (job #2786140) | Cod sursa (job #2896483) | Cod sursa (job #8972) | Cod sursa (job #553618) | Cod sursa (job #154419)
Cod sursa(job #154419)
#include <stdio.h>
long n,k,sol[20];
void generare(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld %ld",&n,&k);
long i, j;
for (i=1; i<=k; i++) sol[i]=i;
while (1){
for (j=1;j<=k;j++)
printf("%ld ",sol[j]);//combinarea
printf("\n");
for (j=k ; j>0 && sol[j]==n-k+j ; j--);
if (!j) return;
sol[j]++;
for (j++ ; j<=k ; j++) sol[j]=sol[j-1]+1;
}
}
int main(){
generare();
return 0;
}