分别用KMP、Monte Carlo 和Las Vegas 算法编制3 个程序，随机生成不小于5000 对、

长度很长、且长度不等的01 串X 和Y（三个程序生成

相同的串），然后统计算法的执行时间、Monte Carlo算法出错的比率，并根据运行结果对三种算法进行深入的比较。注意，

先利用本题下方所给素数实现上述算法，学完素数判定

算法之后，将该算法编程，产生一定数量的大素数并用数组保存起来（分别试不超过5000、500000、50000000），以供上述随机算法使用-The preparation of the three procedures, respectively, of KMP, the Monte Carlo and Las Vegas algorithm randomly generated no less than 5000 pairs,

Length is very long, and a length ranging from 01-string X and Y (three procedures to generate

The same string), then statistical algorithm execution time, error rate of the Monte Carlo method, and the operating results of the three algorithms in-depth comparison. Note that

To this question below to the prime numbers to achieve the above algorithm, the completion of prime numbers to determine

The algorithmic programming algorithm after a certain number of large prime numbers and save them with an array of (respectively, test no more than 5000,500000,50000000), for the above randomized algorithm