说明：  实现死锁避免算法——银行家算法 1、程序运行开始时，资源全部可用。资源种类约10种，每种资源数目为1~10。 2、不断随机产生或手工输入新的“进程资源需求向量”，并填写到最大需求矩阵。 3、在各进程的最大需求数量范围内（因此需作是否超出范围的检验），为各进程随机生成或手工输入资源请求。经银行家算法后输出系统是否安全的信息。当一个进程的资源请求全部发完后，认为它结束
(Deadlock Avoidance Algorithm implementation- one banker' s algorithm, the program running at the beginning of all available resources. About 10 kinds of types of resources, each resource number 1 ~ 10.2, continuously randomly generated or manually enter a new " process of resource requirements vector," and fill in the greatest demand matrix. 3, in the process the greatest number of the scope of the demand (and therefore beyond the scope of required testing), for the process of randomly generated or manually enter the resource requests. By the banker' s algorithm output system after the information is safe. When a process requests resources hair after all, consider it to end)