Cod sursa(job #195658)
Utilizator | Data | 20 iunie 2008 14:54:17 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <math.h>
#include <stdio.h>
long n, k, v[128];
void back(long level) {
long i = 0;
if (level == k) {
for (i = 1; i <= k; ++i) {
printf("%ld ", v[i]);
}
printf("\n");
} else {
for (i = v[level] + 1; i <= n; ++i) {
v[level + 1] = i;
back(level + 1);
}
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%ld %ld\n", &n, &k);
back(0);
return 0;
}