#include
#include
#include
#define?False?0
#define?True?1
int?Max[100][100]={0};//各進程所需各類資源的最大需求
int?Avaliable[100]={0};//系統可用資源
char?name[100]={0};//資源的名稱
int?Allocation[100][100]={0};//系統已分配資源
int?Need[100][100]={0};//還需要資源
int?Request[100]={0};//請求資源向量
int?temp[100]={0};//存放安全序列
int?Work[100]={0};//存放系統可提供資源
int?M=100;//作業的最大數為100
int?N=100;//資源的最大數為100
void?showdata（）//顯示資源矩陣
{
???int?ij;
???printf（“系統目前可用的資源[Avaliable]:\n“）;
???for（i=0;i???printf（“%c??“name[i]）;
???printf（“\n“）;
???for?（j=0;j?????printf（“%d?“Avaliable[j]）;//輸出分配資源
???printf（“\n“）;
????printf（“?????????????Max??????Allocation?????Need?\n“）;
??printf（“進程名??????“）;
????for（j=0;j<3;j++）
{
?????for（i=0;i????printf（“%c??“name[i]）;
?????printf（“???????“）;
}
????printf（“\n“）;
???for（i=0;i??printf（“?%d?????????“i）;
???for（j=0;j???printf（“%d??“Max[i][j]）;
???printf（“???????“）;
???for（j=0;j??????printf（“%d??“Allocation[i][j]）;
???printf（“???????“）;
???for（j=0;j?
???printf（“%d??“Need[i][j]）;
???printf（“\n“）;}
???
}

int?changdata（int?i）//進行資源分配
{?
int?j;
for?（j=0;j??????Avaliable[j]=Avaliable[j]-Request[j];
??????Allocation[i][j]=Allocation[i][j]+Request[j];
??????Need[i][j]=Need[i][j]-Request[j];
}
return?1;
}
int?safe（）//安全性算法
{
int?ik=0mapplyFinish[100]={0};
int?j;
int?flag=0;
Work[0]=Avaliable[0];
Work[1]=Avaliable[1];
Work[2]=Avaliable[2];
for（i=0;i???apply=0;
???for（j=0;j????if?（Finish[i]==False&&Need[i][j]<=Work[j]）{???
?????apply++;
?????if（apply==N）{
??????for（m=0;m?????????Work[m]=Work[m]+Allocation[i][m];//變分配數
?????????Finish[i]=True;
??????temp[k]=i;
??????i=-1;?
?????????k++;
??????flag++;
?????}
????}
???}
}
for（i=0;i???if（Finish[i]==False）{
?????printf（“系統不安全\n“）;//不成功系統不安全
?????return?-1;
???}
}
?????printf（“系統是安全的!\n“）;//如果安全，輸出成功
???printf（“分配的序列:“）;
for（i=0;i????????printf（“%d“temp[i]）;
????if（i“）;
}
????printf（“\n“）;
???return?0;
}
void?share（）//利用銀行家算法對申請資源對進行判定
{
char?ch;
int?i=0j=0;
ch=‘y‘;
?printf（“請輸入要求分配的資源進程號（0-%d）:“M-1）;?
?????scanf（“%d“&i）;//輸入須申請的資源號
printf（“請輸入進程?%d?申請的資源:\n“i）;
for（j=0;j{
???printf（“%c:“name[j]）;
??scanf（“%d“&Request[j]）;//輸入需要申請的資源
}
??????for?（j=0;j??????if（Request[j]>Need[i][j]）//判斷申請是否大于需求，若大于則出錯
???{?
?????printf（“進程?%d申請的資源大于它需要的資源?分配不合理，不予分配！\n“i）;
??????????
?????ch=‘n‘;
???????????break;
}
???????else?{
?????????????if（Request[j]>Avaliable[j]）//判斷申請是否大于當前資源，若大于則出錯
????
			?{?????????????????????????
??????printf（“進程%d申請的資源大于系統現在可利用的資源\n“i）;
???????printf（“?分配出錯，不予分配!\n“）;
???????ch=‘n‘;
?????break;
???????}
????}
????}
????if（ch==‘y‘）?{
???????changdata（i）;//根據進程需求量變換資源
????showdata（）;//根據進程需求量顯示變換后的資源
???????safe（）;//根據進程需求量進行銀行家算法判斷
????}
}

int?main（）//主函數
{

????int?ijqchoicem

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件???????4721??2011-05-27?20:35??bank\bank.txt

?????文件???????4721??2011-05-27?20:37??bank\Cpp1.cpp

?????文件???????3377??2011-05-27?20:31??bank\Cpp1.dsp

?????文件????????531??2011-05-27?21:50??bank\Cpp1.dsw

?????文件??????33792??2011-05-27?21:50??bank\Cpp1.ncb

?????文件??????48640??2011-05-27?21:50??bank\Cpp1.opt

?????文件????????242??2011-05-27?20:52??bank\Cpp1.plg

?????文件?????172099??2011-05-27?20:37??bank\Debug\Cpp1.exe

?????文件?????177932??2011-05-27?20:37??bank\Debug\Cpp1.ilk

?????文件??????16436??2011-05-27?20:37??bank\Debug\Cpp1.obj

????I.A....????265964??2011-05-27?20:31??bank\Debug\Cpp1.pch

?????文件?????345088??2011-05-27?20:37??bank\Debug\Cpp1.pdb

?????文件??????41984??2011-05-27?21:18??bank\Debug\vc60.idb

?????文件??????53248??2011-05-27?20:37??bank\Debug\vc60.pdb

????I.A....???1031989??2011-05-27?21:21??bank\IMAG0109.jpg

????I.A....???1108880??2011-05-27?21:22??bank\IMAG0110.jpg

????I.A....???1074147??2011-05-27?21:22??bank\IMAG0111.jpg

????I.A....???1020740??2011-05-27?21:22??bank\IMAG0112.jpg

?????文件?????173568??2011-05-27?21:48??bank\銀行家算法實驗報告.doc

?????目錄??????????0??2011-05-27?20:37??bank\Debug

?????目錄??????????0??2011-05-27?21:50??bank

-----------?---------??----------?-----??----

??????????????5578099????????????????????21