Permutations without overflow软件

The use of the factorial function in computing permutations and combinations has overflow problems that are avoided by these two functions.

软件应用简介

The use of the factorial function in computing permutations and combinations has overflow problems that are avoided by these two functions.

The use of the factorial function in computing nPr = n!/(n-r)! or in computing nCr = n!/((n-r)!*r!) has overflow problems when n>170 on a 64-bit machine.

These two functions: Perm(n,r) and Comb(n,r) avoid the overflow problem.

nPr is defined as Perm(n,r)

界面展示

结果示意

规格 价