Cod sursa(job #204490)
Utilizator | Data | 24 august 2008 17:19:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
int N,K,v[18];
void printData()
{
for(int i = 0; i<K ; printf("%d ",v[i++]));
printf("\n");
}
void comb(int t)
{
if(t==K) printData();
else
for(int i = !t?1:v[t - 1] + 1; i <= N - K + t + 1; ++i)
{
v[t] = i;
comb(t+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&N,&K);
comb(0);
return 0;
}