Cod sursa(job #1209773)
| Utilizator | Data | 18 iulie 2014 16:59:00 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <stdio.h>
int N, K;
int C[32];
void generate(int k)
{
if (k > K)
{
// Afiseaza combinatia curenta
for (int i = 1; i <= K; ++i)
{
printf("%d ", C[i]);
}
printf("\n");
}
else
{
for (int i = C[k-1] + 1; i <= N-(K-k); ++i)
{
C[k] = i;
generate(k+1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &N, &K);
generate(1);
return 0;
}
