Cod sursa(job #613927)
| Utilizator | Data | 5 octombrie 2011 09:05:29 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | bkt1_oct2011 | Marime | 0.38 kb |
#include<stdio.h>
int n, sol[20], k;
void back (int p){
int i;
if(p-1==k){
for(i=1; i<=k; i++)
printf("%d ", sol[i]);
printf("\n");
return ;
}
for(i=sol[p-1]+1; i<=n; i++){
sol[p]=i;
back(p+1);
}
}
int main(){
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
back(1);
return 0;
}