Run ID:116215
提交时间:2025-04-06 16:55:30
#include <iostream> #include <vector> using namespace std; int main() { int N, M; cin >> N >> M; int sum = N * (N + 1) / 2; int sum1 = (sum + M) / 2; int sum2 = (sum - M) / 2; if ((sum + M) % 2 != 0 || (sum - M) % 2 != 0) { cout << 0 << endl; return 0; } vector<vector<bool>> dp(N + 1, vector<bool>(sum1 + 1, false)); dp[0][0] = true; for (int i = 1; i <= N; ++i) { for (int j = 0; j <= sum1; ++j) { dp[i][j] = dp[i - 1][j]; if (j >= i) { dp[i][j] = dp[i][j] || dp[i - 1][j - i]; } } } int count = 0; if (dp[N][sum1]) { count++; } if (sum1 != sum2) { dp = vector<vector<bool>>(N + 1, vector<bool>(sum2 + 1, false)); dp[0][0] = true; for (int i = 1; i <= N; ++i) { for (int j = 0; j <= sum2; ++j) { dp[i][j] = dp[i - 1][j]; if (j >= i) { dp[i][j] = dp[i][j] || dp[i - 1][j - i]; } } } if (dp[N][sum2]) { count++; } } cout << count << endl; return 0; }