Cod sursa(job #1527645)
Utilizator | Scarlat Elena Anca AncaS | Data | 18 noiembrie 2015 15:34:08 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
# include <cstdio>
FILE *f=freopen("combinari.in","r",stdin);
FILE *g=freopen("combinari.out","w",stdout);
int v[19], numar;
void comb( int n, int k, int pos, FILE *f ) {
if ( pos > k )
{
int i,ok = 0;
for ( i = 1; i <= k; i++ )
printf("%d ", v[i] );
printf("\n" );
}
else
{
for ( v[pos] = v[pos-1] + 1; v[pos] <= n - (k - pos); v[pos]++ )
comb( n, k, pos + 1, g );
}
}
int main()
{
int n,k;
scanf("%d%d",&n,&k);
v[0] = 0;
comb( n , k ,1,f);
// printf("%d",numar);
return 0;
}