银行家算法

银行家算法
#include "dos.h"
#include "conio.h"
#include "alloc.h"

int available[3]={3,3,2};
int max[6][3]={{7,5,3},{3,2,2},{9,0,2},{2,2,2},{4,3,3}};
int allocation[6][3]={{0,1,0},{2,0,0},{3,0,2},{2,1,1},{0,0,2}};
int need[6][3]={{7,4,3},{1,2,2},{6,0,0},{0,1,1},{4,3,1}};
int live[5]={1,1,1,1,1};
int stay[3][3];
int request[3],process[5];
int i,j,p=5,pro,x,k1;
void zhibiao()
{ x=1;
printf(" Max All Nee Ava\n");
printf("PRO A B C A B C A B C A B C\n");
for(i=0;i<p;i++)
{ if(live[i]==1)
{ printf("P%d ",i);
for(j=0;j<=2;j++)
{printf("%-3d",max[i][j]);}printf(" ");
for(j=0;j<=2;j++)
{printf("%-3d",allocation[i][j]);}printf(" ");
for(j=0;j<=2;j++)
{pri