給你三個數字a，b，c，讓你用1～m的數字湊出來

結論：有2個1和2個2肯定湊不出來，然后就搜索

#include <bits/stdc++.h> using namespace std; #define rep(i, j, k) for (int i = int(j); i <= int(k); ++ i) #define dwn(i, j, k) for (int i = int(j); i >= int(k); -- i) typedef long long LL; typedef pair<int, int> P; const int N = 3e5 + 7; char col[N]; int dfs(int i, int j, int k, int x) {if (i == 0 && j == 0 && k == 0) return 1;if (i < 0 || j < 0 || k < 0 || x <= 0) return 0;col[x] = 1;if (dfs(i - x, j, k, x - 1)) return 1;col[x] = 2;if (dfs(i, j - x, k, x - 1)) return 1;col[x] = 3;if (dfs(i, j, k - x, x - 1)) return 1;return 0; } int main() {ios::sync_with_stdio(0);LL a, b, c;cin >> a >> b >> c;LL n = a + b + c;LL x = 1;for (x = 1; n > 0; x ++) n -= x; x --; int xx = x;int c1 = (a == 1) + (b == 1) + (c == 1);int c2 = (a == 2) + (b == 2) + (c == 2);if (c1 >= 2 || c2 >= 2 || n != 0) {printf("Impossible\n");return 0;}dfs(a, b, c, x);// cout << a << ' ' << b << ' ' << c << ' ' << x << '\n';auto tran = [&](int x) -> char {if (x == 1) return 'W';if (x == 2) return 'G';return 'B';};rep(i, 1, xx) printf("%c", tran(col[i])); } /* 11 5 5 */

?

轉載于:https://www.cnblogs.com/tempestT/p/10661076.html

與50位技術專家面對面20年技術見證，附贈技術全景圖

總結

以上是生活随笔為你收集整理的Petrozavodsk Winter Camp, Day 8, 2014, Mosaic的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。