银行家算法用c语言模拟实现

以下是使用C语言实现银行家算法的代码示例：

#include <stdio.h>
#include <stdbool.h>

#define MAX_PROCESS 10
#define MAX_RESOURCE 10

int available[MAX_RESOURCE];
int max[MAX_PROCESS][MAX_RESOURCE];
int allocation[MAX_PROCESS][MAX_RESOURCE];
int need[MAX_PROCESS][MAX_RESOURCE];
bool finish[MAX_PROCESS];

int num_process, num_resource;

void init() {
    printf("请输入进程数和资源数：");
    scanf("%d%d", &num_process, &num_resource);

    printf("请输入每个资源的数量：");
    for (int i = 0; i < num_resource; i++) {
        scanf("%d", &available[i]);
    }

    printf("请输入每个进程已分配的资源数量：\n");
    for (int i = 0; i < num_process; i++) {
        printf("进程 %d：", i);
        for (int j = 0; j < num_resource; j++) {
            scanf("%d", &allocation[i][j]);
        }
    }

    printf("请输入每个进程最大的资源需求量：\n");
    for (int i = 0; i < num_process; i++) {
        printf("进程 %d：", i);
        for (int j = 0; j < num_resource; j++) {
            scanf("%d", &max[i][j]);
            need[i][j] = max[i][j] - allocation[i][j];
        }
    }
}

bool check(int process) {
    for (int i = 0; i < num_resource; i++) {
        if (need[process][i] > available[i]) {
            return false;
        }
    }
    return true;
}

void release(int process) {
    for (int i = 0; i < num_resource; i++) {
        available[i] += allocation[process][i];
        allocation[process][i] = 0;
        need[process][i] = 0;
    }
    finish[process] = true;
}

void banker() {
    int count = 0;
    bool flag = true;
    while (count < num_process) {
        flag = true;
        for (int i = 0; i < num_process; i++) {
            if (!finish[i] && check(i)) {
                release(i);
                printf("进程 %d 执行完毕\n", i);
                count++;
                flag = false;
            }
        }
        if (flag) {
            printf("系统处于不安全状态，无法分配资源\n");
            break;
        }
    }
    if (count == num_process) {
        printf("系统处于安全状态，可以分配资源\n");
    }
}

int main() {
    init();
    banker();
    return 0;
}