Cod sursa(job #162083)
| Utilizator | Data | 19 martie 2008 13:13:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<stdio.h>
int n,sol[20],m;
void scrie(){
for(int i=1;i<m;++i)
printf("%d ",sol[i]);
printf("%d\n",sol[m]);
}
void back(int k){//completeaza sol[k]
if(k==m+1){
//prelucrarea unei solutii
scrie();
return;
}
//aleg un element pentru sol[k]
for(int i=sol[k-1]+1;i<=n-m+k;++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;
}
