Cod sursa(job #160561)
Utilizator | Data | 16 martie 2008 10:17:19 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int n,k,s[30];
void solutie(){
int i;
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int l){
int i,j,ok;
if(l==k)
solutie();
else
for(i=s[l]+1;i<=n;i++){
s[l+1]=i;
back(l+1);
}
}
void main(){
int i;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(0);
}