Cod sursa(job #1443048)
Utilizator | Data | 26 mai 2015 18:31:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
int S[20],N,K;
void Solve(int it)
{
for (int i = S[it-1]+1;i <= N;i++)
{
S[it] = i;
if (it < K)
Solve(it+1);
if (it == K)
{
for (int i = 1;i <= K; i++)
printf("%d ",S[i]);
printf("\n");
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&N,&K);
S[0] = 0;
Solve(1);
return 0;
}