Cod sursa(job #153953)
Utilizator | Data | 10 martie 2008 20:28:46 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
int n,m,x[19];
void afish(){
int i;
for(i=1;i<=m;i++)
printf("%d ",x[i]);
printf("\n");
}
void back(int k){
int i;
for(i=x[k-1]+1;i<=n;i++){
x[k]=i;
if(k==m)
afish();
else
back(k+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
fclose(stdout);
return 0;
}