Cod sursa(job #154086)
Utilizator | Ionut Bogdanescu swift90 | Data | 10 martie 2008 21:56:00 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
int n,k,sol[20];
void afis(){
int i;
for(i=0;i<k-1;++i)
printf("%d ",sol[i]);
printf("%d\n",sol[k-1]);
}
void back(int a,int b){
int i;
if(b==k){
afis();
return;
}
for(i=a+1;i<=n;++i){
sol[b]=i;
back(i,b+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(0,0);
fclose(stdin);
fclose(stdout);
return 0;
}