Cod sursa(job #557122)
Utilizator | Data | 16 martie 2011 14:27:27 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
int n, k, i, v[3000];
void back(int p){
int i;
if(p==k+1){
for(i=1; i<=k; i++)
printf("%d ", v[i]);
printf("\n");
}
else{
for(i=v[p-1]+1; i<=n; i++){
v[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;
}