Cod sursa(job #2096817)
| Utilizator | Data | 29 decembrie 2017 20:57:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int v[20];
int k, n;
void bkt(int x) {
if (x == k + 1) {
for (int i = 1; i <= k; i++)
printf("%d ", v[i]);
printf("\n");
return; }
for (int i = v[x - 1] + 1; i <= n - k + x; i++) {
v[x] = i;
bkt(x + 1); } }
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d", &n);
scanf("%d", &k);
bkt(1);
return 0; }
