Pagini recente » Cod sursa (job #694009) | Cod sursa (job #2215174) | Cod sursa (job #2009893) | Cod sursa (job #1992374) | Cod sursa (job #188636)
Cod sursa(job #188636)
#include<stdio.h>
int m,n, sol[20];
void afisare(){
for(int i=1;i<=m;++i)
printf("%d ", sol[i]);
printf("\n");
}
/*
int valid(int k){
for(int i=1; i<k; ++i)
if(sol[i]>=sol[k])
return 0;
return 1;
}
*/
void back(int k){
if(k==m+1){
afisare();
return;
}
/*
for(int i=1;i<=n;++i){
sol[k]=i;
if(valid(k))
back(k+1);
}
*/
for(int i=sol[k-1]+1;i<=n;++i){
sol[k]=i;
back(k+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &n, &m);
back(1);
return 0;
}