legofit/html/comb_8h_source.html

#ifndef ARR_COMB_H

#define ARR_COMB_H


#include <stdint.h>


int traverseComb(int n, int t,

                 int (*visit)(int tt, int a[tt], void *data),

                 void *data);


int traverseMultiComb(int k, int n[k],

                      int (*visit)(int kk, int nn[kk],

                                   int *b[kk], void *data),

                      void *data);

long multinom(int k, int x[k]);

int64_t binom(int32_t n, int32_t x);

void binom_free(void);


#endif

traverseMultiComb
int traverseMultiComb(int k, int n[k], int(*visit)(int kk, int nn[kk], int *b[kk], void *data), void *data)
Visit each way of allocating N balls among k boxes, such that there are b[0] balls in the first box,...
Definition: comb.c:195

binom
int64_t binom(int32_t n, int32_t x)
Binomial coefficient.
Definition: comb.c:312

binom_free
void binom_free(void)
Free the hash map used to store binom values.
Definition: comb.c:378

multinom
long multinom(int k, int x[k])
Return N!/(prod x[i]!), the number of ways of allocating N = sum(x[i]) balls among k boxes,...
Definition: comb.c:292