此代码是用概率算法来求素数，输入n值便可以得到n以内的所有素数，概率算法相比于确定性算法效率快乐很多，代码中用到了二个经典函数int MillRab(int n) int RepeatMillRab(int n,int k) 计算机面试时考官常问有关这二个函数的问题。-This code is to use probabilistic algorithms to find prime numbers, enter the n value will be able to get all primes less than n, the probability of algorithm efficiency of the algorithm compared to the happy lot of uncertainty, the code used in the two classic functions int MillRab (int n)　int RepeatMillRab (int n, int k)　computer examiners frequently asked interview two functions on this issue.