黄金城防御单位分配方案的C++实现

```cpp #include <iostream> using namespace std; int main() { int m, n; cin >> m >> n; int a, b, c; cin >> a >> b >> c; // 遍历机械守卫的数量 for (int i = 0; i <= m; i++) { // 遍历飞行机器人的数量 for (int j = 0; j <= m - i; j++) { int k = m - i - j; if (i * a + j * b + k * c == n) { cout << i << " " << j << " " << k << endl; } } } return 0; } ``` ######[AI问答 | 189点数解答 | 2026-04-25 19:43:01]