黄金城护盾晶石分配方案的C++实现

```cpp #include <iostream> using namespace std; int main() { int n, m; cin >> n >> m; // 遍历红晶石可能的数量 for (int red = 0; red <= m; red++) { // 遍历蓝晶石可能的数量 for (int blue = 0; blue <= m - red; blue++) { int green = m - red - blue; // 检查总能量是否满足要求 if (red * 5 + blue * 3 + green * 1 == n) { cout << red << " " << blue << " " << green << endl; } } } return 0; } ``` ######[AI问答 | 185点数解答 | 2026-04-25 19:35:32]