传送门：题目详情 - 平分娃娃 II - JMYSOJ (jmfes.com) #include <iostream> using namespace std;

int dp[200001], a[10];

int main() { long long sum = 0; for (int i = 1; i <= 6; ++i) { cin >> a[i]; sum += a[i] * i; } if (sum % 2 == 1) { cout << "Can't be divided." << endl; return 0; } sum /= 2; // 在这里填代码 for(int i = 1; i <= 6; i ++){ for(int j = 1; j <= sum; j ++){ if(j >= i){ dp[j] = max(dp[j], dp[j - a[i]] *a[i]); } } } if (sum == dp[sum]) { cout << "Can be divided." << endl; return 0; } cout << "Can't be divided." << endl; return 0; }