Cod sursa(job #1017160)
| Utilizator | Data | 27 octombrie 2013 13:13:40 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int n, k, v[18];
void back(int l) {
int i;
if (l == k) {
for (i = 1; i <= k; ++i)
printf("%d ", v[i]);
printf("\n");
} else {
for (i = v[l]+1; i <= n; ++i) {
v[l+1] = i;
back(l+1);
}
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
back(0);
return 0;
}
