combinationCount

equals to fact(n) / ( fact(k) * fact( n-k ) )

long

combinationCount

pure nothrow

(

long n

,

long k

)

in { assert (k > 0); assert (n >= 0); }

out (res) { assert (res >= 0); }

Meta

Source

See Implementation

des math combin count functions