Pagini recente » Cod sursa (job #174904) | Cod sursa (job #2318918) | Cod sursa (job #405260) | Cod sursa (job #566913) | Cod sursa (job #622738)
Cod sursa(job #622738)
#include<cstdio>
int marked[21],sol[21];
void print(int m){
int i;
for (i=1;i<=m;++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k,int n,int m){
int i;
if (k==m+1){
print(m);
return;
}
for (i=1;i<=n;++i)
if (!marked[i]&&sol[k-1]<i){
marked[i]=1;
sol[k]=i;
back(k+1,n,m);
marked[i]=0;
}
}
int main(){
int n,m;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
sol[0]=-1;
back(1,n,m);
return 0;
}