#include
#define?false?0
#define?true?1
#define?N?5//進程數
#define?M?3//資源數
int?available[3]={332};
int?max[5][3]={{753}{322}{902}{222}{433}};
int?allocation[5][3]={{010}{200}{302}{211}{002}};
int?Need[5][3];
int?Request[3];
int?safe[N];

//安全算法
int?check（）{
????int?i;
????int?j=0;
	int?work[M];
	for（i=0;i????????work[i]=available[i];
	}
	int?Finish[N]={falsefalsefalsefalsefalse};
????for（i=0;i????????if（Finish[i]==false）{
????????????????if（Need[i][0]<=work[0]&&Need[i][1]<=work[1]&&Need[i][2]<=work[2]）{
????????????????????work[0]=work[0]+allocation[i][0];
????????????????????work[1]=work[1]+allocation[i][1];
????????????????????work[2]=work[2]+allocation[i][2];
????????????????????Finish[i]=true;
?????