Cod sursa(job #1202155)
Utilizator | Data | 27 iunie 2014 00:07:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
#include <vector>
using namespace std;
void bkt(int n, int k, int i, vector<int> &sol) {
if (i == k) {
for (int j = 0; j < k; j++)
printf("%d ", sol[j]);
printf("\n");
return;
}
for (int v = i > 0 ? sol[i-1]+1 : 1; v <= n; v++) {
sol[i] = v;
bkt(n, k, i+1, sol);
}
}
int main() {
int n, k;
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
vector<int> sol(k, 0);
bkt(n, k, 0, sol);
return 0;
}