Pagini recente » Cod sursa (job #2804101) | Cod sursa (job #1121309) | Cod sursa (job #2722070) | Cod sursa (job #2715688) | Cod sursa (job #2650247)
#include <cstdio>
using namespace std;
int comb[20];
int used[20];
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
int n, k;
scanf("%d%d", &n, &k);
int current = 1;
while(current) {
if (current == k+1) {
for(int i=1; i<=k; ++i)
printf("%d ", comb[i]);
printf("\n");
}
if (current == k+1 || used[current] == n) {
used[current] = 0;
--current;
} else {
comb[current] = ++used[current];
used[current + 1] = comb[current];
++current;
}
}
return 0;
}