Pagini recente » Cod sursa (job #1994038) | Cod sursa (job #2931243) | Cod sursa (job #2245320) | Cod sursa (job #1870396) | Cod sursa (job #1754533)
#include<iostream>
using namespace std;
int *a,n,m;
void show(){
for(int i=1;i<=m;i++){
printf("%d ",a[i]);
}
printf("\n");
}
bool solve(int p){
if(p==m){show();return true;}
else{
for(int i=a[p]+1;i<=n;i++){
a[p+1]=i;
solve(p+1);
}
}
}
int main(){
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d",&n,&m);
a=(int*)malloc(sizeof(int*)*100000);
for(int i=0;i<n;i++){
a[i]=i+1;
}
solve(0);
}