def count_solutions(N, M): total_sum = N * (N + 1) // 2 # 计算1到N的连续整数和 count = 0 # 遍历所有可能的子数组A1 for i in range(1, N + 1): if (total_sum + M) % 2 == 0: # 确保M是偶数 a1_sum = i * (i + 1) // 2 # 计算子数组A1的和 a2_sum = total_sum - a1_sum # 计算子数组A2的和 # 检查和的差是否等于M if abs(a1_sum - a2_sum) == M: count += 1 return count def main(): N, M = map(int, input().split()) # 读取输入 result = count_solutions(N, M) print(result) if __name__ == "__main__": main()