请给出一段用C语言写的银行家算法

下面是一段用C语言写的银行家算法的代码：

#include <stdio.h>

#define MAX_PROCESS 10
#define MAX_RESOURCE 10

int main() {
    int n, m;
    int i, j, k;
    int need[MAX_PROCESS][MAX_RESOURCE], allocation[MAX_PROCESS][MAX_RESOURCE], available[MAX_RESOURCE];
    int work[MAX_RESOURCE], finish[MAX_PROCESS] = {0};
    int safe_sequence[MAX_PROCESS], count = 0;

    printf("Enter number of processes: ");
    scanf("%d", &n);
    printf("Enter number of resources: ");
    scanf("%d", &m);

    printf("Enter allocation matrix: ");
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            scanf("%d", &allocation[i][j]);
        }
    }

    printf("Enter maximum matrix: ");
    for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
            scanf("%d", &need[i][j]);
            need[i][j] -= allocation[i][j];
        }
    }

    printf("Enter available matrix: ");
    for (i = 0; i < m; i++) {
        scanf("%d", &available[i]);
    }

    for (i = 0; i < m; i++) {
        work[i] = available[i];
    }

    for (k = 0; k < n; k++) {
        for (i = 0; i < n; i++) {
            if (finish[i] == 0) {
                for (j = 0; j < m; j++) {
                    if (need[i][j] > work[j]) {
                        break;
                    }
                }
                if (j == m) {
                    for (j = 0; j < m; j++) {
                        work[j] += allocation[i][j];
                    }
                    finish[i] = 1;
                    safe_sequence[count++] = i;
                }
            }
        }
    }

    if (count == n) {
        printf("System is in safe state.\n");
        printf("Safe sequence is: ");
        for (i = 0; i < n; i++) {
            printf("P%d ", safe_sequence[i]);
        }
        printf("\n");
    } else {
        printf("System is not in safe state.\n");
    }

    return 0;
}

这段代码实现了银行家算法，包括输入进程数、资源数、分配矩阵、最大矩阵和可用矩阵，以及输出系统是否处于安全状态和安全序列。其中，need数组表示每个进程还需要的资源数，work数组表示可用的资源数，finish数组表示每个进程是否完成，safe_sequence数组表示安全序列。