java挑选数字_如何根据概率选择一个数字？

为此，我将使用Mersenne Twister算法进行Boost提供的均匀分布，然后使用映射函数将随机分布的结果映射到实际的数字选择 .

这是一个潜在实现的快速示例，尽管我遗漏了四元方程实现，因为它是众所周知的：

int f_of_xib(int x, int i, int b)

{

return x * i * i / 2 + b * i;

}

int b_of_x(int i, int x)

{

return (r - ( r ) / 2 );

}

int pickANumber(mt19937 gen, int n, int x)

{

// First, determine the range r required where the probability equals i * x

// since probability of each increasing integer is x higher of occuring.

// Let f(i) = r and given f'(i) = x * i then r = ( x * i ^2 ) / 2 + b * i

// where b = ( r - ( x * i ^ 2 ) / 2 ) / i . Since r = x when i = 1 from problem

// definition, this reduces down to b = r - r / 2. therefore to find r_max simply

// plugin x to find b, then plugin n for i, x, and b to get r_max since r_max occurs

// when n == i.

// Find b when

int b = b_of_x(x);

int r_max = f_of_xib(x, n, b);

boost::uniform_int<> range(0, r_max);

boost::variate_generator<:mt19937 boost::uniform_int> > next(gen, range);

// Now to map random number to desired number, just find the positive value for i

// when r is the return random number which boils down to finding the non-zero root

// when 0 = ( x * i ^ 2 ) / 2 + b * i - r

int random_number = next();

return quadtratic_equation_for_positive_value(1, b, r);

}

int main(int argc, char** argv)

{

mt19937 gen;

gen.seed(time(0));

pickANumber(gen, 10, 1);

system("pause");

}