银行家算法

#include <stdio.h>
#include <conio.h>


int main()
{
int Max[10][10], need[10][10], alloc[10][10], avail[10],avail0[10], completed[10], safeSequence[10];
int p, r, i, j, process, count;
count = 0;

printf("进程数量为: ");
scanf("%d", &p);

for(i = 0; i< p; i++)
	completed[i] = 0;

printf("\n\n资源数量为: ");
scanf("%d", &r);

printf("\n\n输入每个进程最大需求: ");
for(i = 0; i < p; i++)
{
	printf("\n进程%d : ", i + 1);
	for(j = 0; j < r; j++)
		scanf("%d", &Max[i][j]);
}

printf("\n\n各个进程已分配的资源数量：");
for(i = 0; i < p; i++)
{
	printf("\n进程 %d : ",i + 1);
	for(j = 0; j < r; j++)
		scanf("%d", &alloc[i][j]);
}

printf("\n\n可用资源数 : ");
for(i = 0; i < r; i++)
		scanf("%d", &avail[i]);


	for(i = 0; i < p; i++)
		for(j = 0; j < r; j++)
			need[i][j] = Max[i][j] - alloc[i][j];

do
{
	printf("\n 最大资源:\t    已分配资源:\n");
	for(i = 0; i < p; i++)
	{
		for( j = 0; j < r; j++)
			printf("%d  ", Max[i][j]);
		printf("\t\t");
		for( j = 0; j < r; j++)
			printf("%d  ", alloc[i][j]);
		printf("\n");
	}

	process = -1;

	for(i = 0; i < p; i++)
	{
		if(completed[i] == 0)//if not completed
		{
			process = i ;
			for(j = 0; j < r; j++)
			{
				if(avail[j] < need[i][j])
				{
					process = -1;
					break;
				}
			}
		}
		if(process != -1)
			break;
	}

	if(process != -1)
	{
		printf("\n进程 %d 已完成!", process + 1);
		safeSequence[count] = process + 1;
		count++;
		for(j = 0; j < r; j++)
		{
			avail[j] += alloc[process][j];
			alloc[process][j] = 0;
			Max[process][j] = 0;
			completed[process] = 1;
		}
	}
}while(count != p && process != -1);

if(count == p)
{
	printf("\n系统处于安全状态!!\n");
	printf("安全序列 : < ");
	for( i = 0; i < p; i++)
			printf("%d  ", safeSequence[i]);
	printf(">\n");
}
else
	printf("\n系统处于非安全状态!!");
getch();
}