银行家算法

#include "stdio.h"

#define M 50 //总进程数

#define N 30 //总资源数

#define FALSE 0

#define TRUE 1

int m,n;

//系统可用资源数

int AVAILABLE[N];

//M个进程已经得到N类资源的资源量

int ALLOCATION[M][N];

//M个进程还需要N类资源的资源量

int NEED[M][N];

int Request[N];

 

 main()

{

       int i=0,j=0;

       int flag=1;

       void showdata();

       void changdata(int);

       void rstordata(int);

       int chkerr(int);

       printf("输入进程总数m:");

    scanf("%d", &m);                          

    printf("输入资源种类总数n:");

    scanf("%d", &n);                                                                        

       printf("输入已分配资源数/n");

       for(i=0;i<m; i++)

              for(j=0;j<n; j++)

                     scanf("%d", &ALLOCATION[i][j]);

       printf("输入还需要的资源数/n");

              for (i=0;i<m; i++)

                     for(j=0;j<n; j++)

                     {

                     scanf("%d",&NEED [i][j]);

                     }

       printf("/n输入可利用的资源数/n");