Cod sursa(job #549539)
Utilizator | Tabara Mihai Tabara | Data | 8 martie 2011 18:53:38 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
#define in "combinari.in"
#define out "combinari.out"
#define NMAX 21
int N, K;
int S[NMAX];
void Back(int lng)
{
int i;
if (lng == K) {
for (i = 1; i <= K; ++i)
printf("%d ", S[i]);
printf("\n");
}
else {
for (i = S[lng]+1; i <= N; ++i) {
S[lng+1] = i;
Back(lng+1);
}
}
}
int main(void)
{
freopen(in, "r", stdin);
freopen(out, "w", stdout);
scanf("%d%d", &N, &K);
Back(0);
return 0;
}