分别用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 (2012-03-25, Visual C++, 2KB, 下载31次)
世界名画陈列室由m*n个排列成矩形阵列的陈列室组成。为了防止名画被盗，需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外，还可以监视与它所在的陈列室相邻的上、下、左、右4个陈列室。试设计一个安排警卫机器人哨位的算法，使得名画陈列馆中每一个陈列室都在警卫机器人的监视下，且所有的警卫机器人数最少。
Gallery by the world famous painting of m* n rectangular array arranged in the composition of the showroom. In order to prevent the paintings were stolen, need to set up showroom robot sentry guards. In addition to monitoring the security of each robot in the showroom it also can monitor it in the showroom and the adjacent upper and lower, left and right four showrooms. Try to design a robot sentry security arrangements of the algorithm, making each painting a showroom gallery in the security surveillance robots, and all at least a few of the security robot. (2009-07-06, Visual C++, 7KB, 下载11次)
世界名画陈列室由m*n个排列成矩形阵列的陈列室组成。为了防止名画被盗，需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外，还可以监视与它所在的陈列室相邻的上、下、左、右4个陈列室。试设计一个安排警卫机器人哨位的算法，使得名画陈列馆中每一个陈列室都在警卫机器人的监视下，且所有的警卫机器人数最少。
Gallery by the world famous painting of m* n rectangular array arranged in the composition of the showroom. In order to prevent the paintings were stolen, need to set up showroom robot sentry guards. In addition to monitoring the security of each robot in the showroom it also can monitor it in the showroom and the adjacent upper and lower, left and right four showrooms. Try to design a robot sentry security arrangements of the algorithm, making each painting a showroom gallery in the security surveillance robots, and all at least a few of the security robot. (2009-06-08, Visual C++, 3KB, 下载34次)
问题描述：
给定m个整数组成的向量A， ， ，和另一个由n个整数1 2 , , , m a a L a i a ≤m 1≤ i ≤m
组成的向量B， ， 。向量A和B之间的距离dist定义为： 1 2 , , , n b b L b i b ≤ n 1≤ i ≤ n
( ) { }。1 ,1
, min i m j n i j
dist A B a b
≤ ≤ ≤ ≤
= −
向量距离问题要求给定向量A和B的距离。
例如，当m=5，n=5，相应向量A为：（-5，3，-5，2，4），向量B为：（-2，-3，-2，-3，-1）
时，dist(A, B) = 2。
编程任务：
对于给定的m 个整数组成的向量A， ， ，和另一个由n 1 2 , , , m a a L a i a ≤m 1≤ i ≤m
个整数组成的向量B， ， ，试设计一个O(m + n)时间算法，计1 2 , , , n b b L b i b ≤ n 1≤ i ≤ n
算给定向量A和B的距离。
数据输入：
由文件input.txt提供输入数据。文件的第1行有2个正整数m和n。第2行是整数向量A：
。第3行是整数向量B： 。1 2 , , , m a a L a 1 2 , , , n b b L b
结果输出:
程序运行结束时，将计算出的向量A和B的距离输出到output.txt中。
输入示例输出示例
input.txt output.txt
5 5
-5 3 -5 2 4
-2 -3 -2 -3 -1
2
Problem description:
A given integer m, composed of a vector A,,, and another by the n integers 1 2,,, maa L aia ≤ m 1 ≤ i ≤ m
Vector composed of B,,. Vector between A and B is defined as dist from: 1 2,,, nbb L bib ≤ n 1 ≤ i ≤ n
() (). 1, 1
, Min i m j n i j
dist A B a b
≤ ≤ ≤ ≤
=--
Vector directed away from the issue of the volume of requests to the distance between A and B.
For example, when m = 5, n = 5, corresponding to vector A: (-5,3,-5,2,4), vector B is: (-2,-3,-2,-3,-1)
When, dist (A, B) = 2.
Programming tasks:
For a given integer m, composed of a vector A,,, and another by the n 1 2,,, maa L aia ≤ m 1 ≤ i ≤ m
Integral component of the vector B,,, try to design a O (m+ n) time algorithm, namely 1 2,,, nbb L bib ≤ n 1 ≤ i ≤ n
Directional traffic count to the distance between A and B.
Data entry:
Provided by the input data file input.txt. Line 1 of the document are two positive integers m and n. Line 2 is an integer vector A:
. Line 3 is an integer vector (2009-05-15, Visual C++, 758KB, 下载18次)
利用c++编写的带人工智能的跳棋程序。屏幕的中央是棋盘，所有的操作都是对这个棋盘进行的，棋子的选择框是红色的，移动它（“w”、“s”、“a”、“d”分别代表上、下、左、右）进行选子和选择目的地，利用空格键可以表示选定选择框到达的位置，棋盘左边有提示信息，提示由哪个玩家走棋。“Q”表示退出游戏，“R”表示重新开始，“H”表示悔棋（一次只能悔一步棋）
Using c++, prepared with artificial intelligence Checkers procedures. Screen are the central board, all the operations are carried out on the chessboard, chess pieces of the selection box is red, move it ( " w" , " s" , " a" , " d" represent the upper and lower left , right) to carry out the election, and the selection of destination, using the space bar can be selected express selection box arrive the location, the left has a message board, indicating which player moves. " Q" exit express Game, " R" express a fresh start, " H" express悔棋(one can only regret move) (2009-03-05, Visual C++, 94KB, 下载10次)
设A和B是长度相同的2个字符串。A和B的距离定义为相应位置字符距离之和。2个非空格字符的距离是它们的ASCII码之差的绝对值。空格与空格的距离为0；空格与其它字符的距离为一定值k。
字符串A的扩展是在A中插入若干空格字符所产生的字符串。在字符串A和B的所有长度相同的扩展中，有一对距离最小的扩展，该距离称为字符串A和B的扩展距离。
对于给定的字符串A和B，试设计一个算法，计算其扩展距离。
Let A and B is the same length of two strings. A and B is defined as the distance between the corresponding location and distance characters. Two non-space character, the distance between them is the ASCII of absolute poor. And the blank spaces in the range of 0; Space with other characters to a certain distance from the k value. A string of expansion is inserted in A certain space character from the string. In the A and B string in all the same length of the extension, a minimum distance of the expansion, The distance from the string as A and B from the expansion. For a given string, A and B, test design an algorithm to calculate the distance of expansion. (2007-04-01, Visual C++, 162KB, 下载9次)