#include <iostream>
const int MAXM = 1;
const int MAXN = 100;
using namespace std;
int Resource[MAXM], Available[MAXM];
int Claim[MAXN][MAXM], Allocation[MAXN][MAXM];
int n;
int Need[MAXN][MAXM];
bool Finish[MAXN];
int finished;
bool IsAvailable(const int thisNeed[], const int thisAvailable[]){
for(int i = 0; i < MAXM; i++){
if(thisNeed[i] > thisAvailable[i]) return false;
}
return true;
}
void LineAdd(int LineA[], int LineB[]){
for(int i = 0; i < MAXM; i++){
LineA[i] += LineB[i];
}
}
int main()
{
cout << "Please input " << MAXM << " integers of Resource:" << endl;
for(int i = 0; i < MAXM; i++) cin >> Resource[i];
cout << "Please input " << MAXM << " integers of Available:" << endl;
for(int i = 0; i < MAXM; i++) cin >> Available[i];
cout << "Please input the number of process:" << endl;
cin >> n;
for(int i = 1; i <= n; i++){
cout << "Please input " << MAXM << " integers of Claim[" << i << "]:" << endl;
for(int j = 0; j < MAXM; j++) cin >> Claim[i][j];
}
for(int i = 1; i <= n; i++){
cout << "Please input " << MAXM << " integers of Allocation[" << i << "]:" << endl;
for(int j = 0; j < MAXM; j++) cin >> Allocation[i][j];
}
cout << "Running..." << endl;
for(int i = 1; i <= n; i++){
for(int j = 0; j < MAXM; j++){
Need[i][j] = Claim[i][j] - Allocation[i][j];
}
Finish[i] = false;
}
finished = 0;
for(int times = 0; times < n; times++){
for(int i = 1; i <= n; i++){
if(!Finish[i]){
if(IsAvailable(Need[i], Available)){
Finish[i] = true;
finished++;
LineAdd(Available, Claim[i]);
}
}
}
}
if(finished == n){
cout << "True" << endl;
}else{
cout << "False" << endl;
}
return 0;
}
银行家算法(并没有注释
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- 下面选了最近十年里,十位名人所做的毕业演讲。那么多的故事与经历,其实只想告诉你一件事: 面对迷茫和不确定的未来,我...
- 图片均是原创,转载请告知,谢谢。 昨天有朋友问我美国学校这边的作息和学生的一日活动,今天我们一起来看一看: 一日流...