C++编写一个系统动态分配资源的模拟程序，采用银行家算法有效地避免死锁的发生。要求程序能够在进程提出资源申请后判断系统是否处于安全状态，如果安全则打印资源分配表和安全序列；如果不安全则输出不能分配的提示。

以下是一个简单的 C++ 实现：

#include <iostream>
#include <vector>
using namespace std;

const int MAX_PROCESS = 10;
const int MAX_RESOURCE = 10;

int available[MAX_RESOURCE];
int max_need[MAX_PROCESS][MAX_RESOURCE];
int allocated[MAX_PROCESS][MAX_RESOURCE];
bool finished[MAX_PROCESS];

bool is_safe(int n_process, int n_resource, vector<int> &safe_seq)
{
    int need[MAX_PROCESS][MAX_RESOURCE];
    int work[MAX_RESOURCE];
    for (int i = 0; i < n_resource; i++)
        work[i] = available[i];
    for (int i = 0; i < n_process; i++) {
        for (int j = 0; j < n_resource; j++) {
            need[i][j] = max_need[i][j] - allocated[i][j];
            if (need[i][j] < 0)
                return false; // 进程申请超出其最大需求
        }
        finished[i] = false;
    }
    bool found;
    do {
        found = false;
        for (int i = 0; i < n_process; i++) {
            if (!finished[i]) {
                bool enough = true;
                for (int j = 0; j < n_resource; j++) {
                    if (need[i][j] > work[j]) {
                        enough = false;
                        break;
                    }
                }
                if (enough) {
                    for (int j = 0; j < n_resource; j++)
                        work[j] += allocated[i][j];
                    finished[i] = true;
                    safe_seq.push_back(i);
                    found = true;
                }
            }
        }
    } while (found);
    for (int i = 0; i < n_process; i++) {
        if (!finished[i]) {
            return false;
        }
    }
    return true;
}

int main()
{
    int n_process, n_resource;
    cout << "请输入进程数和资源种类数：";
    cin >> n_process >> n_resource;
    cout << "请输入每个进程的最大需求量：" << endl;
    for (int i = 0; i < n_process; i++) {
        cout << "进程 " << i << "：";
        for (int j = 0; j < n_resource; j++) {
            cin >> max_need[i][j];
        }
    }
    cout << "请输入当前可用资源量：" << endl;
    for (int i = 0; i < n_resource; i++) {
        cin >> available[i];
    }
    cout << "请输入已分配的资源量：" << endl;
    for (int i = 0; i < n_process; i++) {
        cout << "进程 " << i << "：";
        for (int j = 0; j < n_resource; j++) {
            cin >> allocated[i][j];
            available[j] -= allocated[i][j];
        }
    }
    vector<int> safe_seq;
    if (is_safe(n_process, n_resource, safe_seq)) {
        cout << "系统处于安全状态，安全序列为：";
        for (int i = 0; i < safe_seq.size(); i++) {
            cout << safe_seq[i] << " ";
        }
        cout << endl;
        cout << "资源分配表：" << endl;
        cout << "进程编号\t已分配\t最大需求\t剩余需求\t可用资源" << endl;
        for (int i = 0; i < n_process; i++) {
            cout << i << "\t\t";
            for (int j = 0; j < n_resource; j++) {
                cout << allocated[i][j] << "\t";
            }
            cout << "\t";
            for (int j = 0; j < n_resource; j++) {
                cout << max_need[i][j] << "\t";
            }
            cout << "\t";
            for (int j = 0; j < n_resource; j++) {
                cout << max_need[i][j] - allocated[i][j] << "\t";
            }
            cout << "\t";
            if (i == 0) {
                for (int j = 0; j < n_resource; j++) {
                    cout << available[j] << "\t";
                }
            }
            cout << endl;
        }
    } else {
        cout << "系统不处于安全状态，无法分配资源。" << endl;
    }
    return 0;
}

使用时，先输入进程数和资源种类数，然后分别输入每个进程的最大需求量、当前可用资源量和已分配的资源量。程序会自动判断系统是否处于安全状态，并输出相应的资源分配表和安全序列。如果系统不处于安全状态，则输出提示信息。