银行家算法7.docVIP

银行家算法7 #define M 50 int max[M][M], allocation[M][M],need[M][M],available[M]; /*定义全局变量*/ int i, j, n, m, r; main() { void check(); void print(); int p,q; int req[M], allocation1[M][M],need1[M][M],available1[M]; printf(Please input the processes sum:); scanf(%d, n); /*输入进程总数*/ printf(Please input the kinds sum :); scanf(%d, m); /*输入资源种类总数*/ printf(please input the max resources :); for(i=0;in; i++) for(j=0;jm; j++) {scanf(%2d,max[i][j]); } /*输入最大矩阵*/ printf(please input the allocation resources :); for(i=0;in; i++) for(j=0;jm; j++) scanf(%d, allocation[i][j]); /*输入已分配资源数*/ printf(please input the need resources :); for (i=0;in; i++) for(j=0;jm; j++) { need[i][j]=max[i][j]-allocation[i][j]; printf(%2d,need[i][j]); } /*输出还需要的资源数*/ printf(\nplease input the available number :); for (i=0;im; i++) scanf(%d, available[i]); /*输入可用资源数*/ check(); /*检测已知的状态是否安全*/ if (r==1) /*如果已知的状态安全则执行以下代码*/ { do { p=0,q=0; printf(\nplease input the NO. of process: ); scanf(%d, i); /*输入请求资源的进程号*/ printf(please input the resources of request:); for(j=0;jm; j++) scanf(%d,req[j]); /*输入该进程所需的资源数 */ for(j=0;jm; j++) if(req[j]need[i][j]) p=1; /*判断请求是否超过最大资源数*/ if(p) printf(The resources of request have been beyond the max number needed!); else { for(j=0;jm; j++) if(req[j]available[j]) q=1; /*判断请求是否超过可用资源数 */ if(q) printf(There are not enough available resources!); else {