Cod sursa(job #672744)
| Utilizator | Data | 2 februarie 2012 23:46:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
int n,k,v[20];
void tipar(){
for(int i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
}
void solve(int niv){
if(niv==k+1) tipar();
else {
for(int i=v[niv-1]+1;i<=n;i++){
v[niv]=i;
solve(niv+1);
}
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
solve(1);
return 0;
}
