from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 26968 # 目标值 BASE_VALUES = [36.5, 41.5, 59, 68.5, 74, 91.5] # 基础系数列表 FLUCTUATION = 1.0 # 系数波动范围 MAX_SOLUTIONS = 3 # 每个组合的最大解数量 SOLVER_TIMEOUT = 180 # 求解超时时间(秒) THREE_VAR_THRESHOLD = 259000 # 使用三个变量的阈值 PRODUCT_RANGE_THRESHOLD = 129000 # 乘积范围限制阈值 HIGH_TARGET_THRESHOLD = 259000 # 更高目标值阈值 SHOW_PROGRESS = True # 是否显示进度 MAX_SOLUTIONS_PER_COMB = 100 # 每个组合的最大解数量,用于提前终止 USE_MULTIPROCESSING = True # 是否使用多进程加速 def is_valid_product(p): """确保单个乘积不超过129000""" return p <= 129000 # 严格限制所有乘积不超过129000 def find_single_variable_solutions(values): """查找单个数的解(a*x = TARGET)""" solutions = [] for a in values: quotient = TARGET / a if quotient != int(quotient): continue x = int(quotient) if 1 <= x <= 10000 and is_valid_product(a * x): solutions.append((a, x)) if len(solutions) >= MAX_SOLUTIONS: break return solutions def find_two_variable_solutions(values): """优化的双变量求解算法,确保每个乘积不超过129000""" solutions = defaultdict(list) for i, a in enumerate(values): for b in values[i:]: seen_xy = set() # 调整x的最大值,确保a*x不超过129000 if max_x < min_x: continue x_count = max_x - min_x + 1 x_step = max(1, x_count // 1000) for x in range(min_x, max_x + 1, x_step): ax = a * x if ax > 129000: # 额外检查确保不超过129000 continue remainder = TARGET - ax if remainder < b: break if remainder > b * 10000: continue if remainder % b == 0: y = remainder // b by = b * y if 1 <= y <= 10000 and by <= 129000: # 确保b*y也不超过129000 xy_pair = (x, y) if a <= b else (y, x) if xy_pair not in seen_xy: seen_xy.add(xy_pair) solutions[(a, b)].append((a, x, b, y)) if len(solutions[(a, b)]) >= MAX_SOLUTIONS_PER_COMB: break return solutions def process_three_var_combination(args): """处理三变量组合的辅助函数,用于并行计算""" a, b, c, value_ranges, target = args solutions = [] seen_xyz = set() min_x, max_x = value_ranges[a] x_count = max_x - min_x + 1 x_step = max(1, x_count // 1000) for x in range(min_x, max_x + 1, x_step): ax = a * x if not is_valid_product(ax): continue remainder1 = target - ax if remainder1 < 0: break if max_y < min_y: continue y_count = max_y - min_y + 1 y_step = max(1, y_count // 100) for y in range(min_y, max_y + 1, y_step): by = b * y if not is_valid_product(by): continue remainder2 = remainder1 - by if remainder2 < 0: break if remainder2 > c * 10000: continue if remainder2 % c == 0: z = remainder2 // c if 1 <= z <= 10000 and is_valid_product(c * z): xyz_tuple = tuple(sorted([x, y, z])) if xyz_tuple not in seen_xyz: seen_xyz.add(xyz_tuple) solutions.append((a, x, b, y, c, z)) if len(solutions) >= MAX_SOLUTIONS_PER_COMB: return solutions return solutions def find_three_variable_solutions(values): """优化的三变量求解算法,确保每个乘积不超过129000""" solutions = defaultdict(list) sorted_values = sorted(values) # 预计算每个系数的有效范围,确保每个乘积不超过129000 value_ranges = {} for a in sorted_values: value_ranges[a] = (min_x, max_x) combinations_list = [] for i, a in enumerate(sorted_values): for j in range(i + 1, len(sorted_values)): b = sorted_values[j] for k in range(j + 1, len(sorted_values)): c = sorted_values[k] combinations_list.append((a, b, c, value_ranges, TARGET)) if USE_MULTIPROCESSING: with Pool() as pool: results = pool.map(process_three_var_combination, combinations_list) for i, (a, b, c, _, _) in enumerate(combinations_list): if results[i]: solutions[(a, b, c)] = results[i] else: total_combinations = len(combinations_list) for i, (a, b, c, _, _) in enumerate(combinations_list): res = process_three_var_combination((a, b, c, value_ranges, TARGET)) if res: solutions[(a, b, c)] = res if SHOW_PROGRESS and i % 10 == 0: print(f"\r三变量组合进度: {i}/{total_combinations} 组", end='') if SHOW_PROGRESS and not USE_MULTIPROCESSING: print(f"\r三变量组合进度: {total_combinations}/{total_combinations} 组 - 完成") return solutions def find_balanced_solutions(solutions, var_count, num=2): """从所有解中筛选出最平衡的解""" if var_count == 1 or not solutions: return solutions balanced = [] for sol in solutions: vars = sol[1::2] # 获取解中的变量值 diff = max(vars) - min(vars) # 计算变量之间的最大差值 balanced.append((diff, sol)) # 按差值排序,返回差值最小的解 return [s for _, s in sorted(balanced, key=lambda x: x[0])[:num]] def find_original_solutions(solutions, balanced_solutions, num=3): """从剩余解中获取原始顺序的解""" if not solutions: return [] remaining = [s for s in solutions if s not in balanced_solutions] return remaining[:num] def display_solutions(solutions_dict, var_count): """优化的解显示函数""" if not solutions_dict: return print(f"\n找到 {len(solutions_dict)} 组{var_count}变量解:") for i, (coeffs, pair_solutions) in enumerate(sorted(solutions_dict.items()), 1): balanced = find_balanced_solutions(pair_solutions, var_count) original = find_original_solutions(pair_solutions, balanced) all_display = balanced + original if var_count == 1: a = coeffs print(f"\n{i}. 组合: a={a} ({len(pair_solutions)} 个有效解)") elif var_count == 2: a, b = coeffs print(f"\n{i}. 组合: a={a}, b={b} ({len(pair_solutions)} 个有效解)") else: a, b, c = coeffs print(f"\n{i}. 组合: a={a}, b={b}, c={c} ({len(pair_solutions)} 个有效解)") for j, sol in enumerate(all_display, 1): tag = "[平衡解]" if j <= len(balanced) else "[原始解]" if var_count == 1: a, x = sol print(f" {j}. x={x}, a*x={a*x:.1f}, 总和={a*x:.1f} {tag}") elif var_count == 2: a, x, b, y = sol print(f" {j}. x={x}, y={y}, a*x={a*x:.1f}, b*y={b*y:.1f}, 总和={a*x + b*y:.1f} {tag}") else: a, x, b, y, c, z = sol print(f" {j}. x={x}, y={y}, z={z}, " f"a*x={a*x:.1f}, b*y={b*y:.1f}, c*z={c*z:.1f}, " f"总和={a*x + b*y + c*z:.1f} {tag}") def run_with_timeout(func, args=(), kwargs=None, timeout=SOLVER_TIMEOUT): """运行函数并设置超时限制""" if kwargs is None: kwargs = {} result = [] error = [] def wrapper(): try: result.append(func(*args, **kwargs)) except Exception as e: error.append(e) thread = threading.Thread(target=wrapper) thread.daemon = True thread.start() thread.join(timeout) if thread.is_alive(): print(f"警告: {func.__name__} 超时({timeout}秒),跳过此方法") return None if error: return result[0] def main(): print(f"目标值: {TARGET}") # 生成波动后的系数 FLUCTUATED_VALUES = [round(v - FLUCTUATION, 1) for v in BASE_VALUES] # 尝试基础系数 print(f"\n==== 尝试基础系数 ====") # 目标值255966 > 259000不成立,会按顺序尝试单、双、三变量解 base_solutions = { 'single': run_with_timeout(find_single_variable_solutions, args=(BASE_VALUES,)), 'two': run_with_timeout(find_two_variable_solutions, args=(BASE_VALUES,)), 'three': [] } has_solution = False # 显示单变量解 if base_solutions['single']: has_solution = True display_solutions({a: [sol] for a, sol in zip(BASE_VALUES, base_solutions['single']) if sol}, 1) # 显示双变量解 if base_solutions['two'] and len(base_solutions['two']) > 0: has_solution = True display_solutions(base_solutions['two'], 2) # 单变量和双变量都无解时,尝试三变量解 if not has_solution: print(f"\n==== 单变量和双变量无解,尝试三变量解 ====") base_solutions['three'] = run_with_timeout(find_three_variable_solutions, args=(BASE_VALUES,)) if base_solutions['three'] and len(base_solutions['three']) > 0: has_solution = True display_solutions(base_solutions['three'], 3) if has_solution: print(f"\n使用基础系数列表,共找到有效解") return # 如果基础系数没有找到解,尝试波动系数 print(f"\n==== 尝试波动系数 ====") fluctuated_solutions = { 'single': run_with_timeout(find_single_variable_solutions, args=(FLUCTUATED_VALUES,)), 'two': run_with_timeout(find_two_variable_solutions, args=(FLUCTUATED_VALUES,)), 'three': [] } has_solution = False # 显示单变量解 if fluctuated_solutions['single']: has_solution = True display_solutions({a: [sol] for a, sol in zip(FLUCTUATED_VALUES, fluctuated_solutions['single']) if sol}, 1) # 显示双变量解 if fluctuated_solutions['two'] and len(fluctuated_solutions['two']) > 0: has_solution = True display_solutions(fluctuated_solutions['two'], 2) # 单变量和双变量都无解时,尝试三变量解 if not has_solution: print(f"\n==== 单变量和双变量无解,尝试三变量解 ====") fluctuated_solutions['three'] = run_with_timeout(find_three_variable_solutions, args=(FLUCTUATED_VALUES,)) if fluctuated_solutions['three'] and len(fluctuated_solutions['three']) > 0: has_solution = True display_solutions(fluctuated_solutions['three'], 3) if has_solution: print(f"\n使用波动系数列表,共找到有效解") return # 如果所有系数集都没有找到解 print("\n没有找到符合条件的解,即使使用波动后的系数列表。") if __name__ == "__main__": main() print(f"\n总耗时: {time.time() - start_time:.2f}秒")
Standard input is empty
目标值: 26968 ==== 尝试基础系数 ==== 找到 15 组2变量解: 1. 组合: a=36.5, b=41.5 (9 个有效解) 1. x=350, y=342.0, a*x=12775.0, b*y=14193.0, 总和=26968.0 [平衡解] 2. x=267, y=415.0, a*x=9745.5, b*y=17222.5, 总和=26968.0 [平衡解] 3. x=18, y=634.0, a*x=657.0, b*y=26311.0, 总和=26968.0 [原始解] 4. x=101, y=561.0, a*x=3686.5, b*y=23281.5, 总和=26968.0 [原始解] 5. x=184, y=488.0, a*x=6716.0, b*y=20252.0, 总和=26968.0 [原始解] 2. 组合: a=36.5, b=59 (7 个有效解) 1. x=262, y=295.0, a*x=9563.0, b*y=17405.0, 总和=26968.0 [平衡解] 2. x=380, y=222.0, a*x=13870.0, b*y=13098.0, 总和=26968.0 [平衡解] 3. x=26, y=441.0, a*x=949.0, b*y=26019.0, 总和=26968.0 [原始解] 4. x=144, y=368.0, a*x=5256.0, b*y=21712.0, 总和=26968.0 [原始解] 5. x=498, y=149.0, a*x=18177.0, b*y=8791.0, 总和=26968.0 [原始解] 3. 组合: a=36.5, b=68.5 (5 个有效解) 1. x=219, y=277.0, a*x=7993.5, b*y=18974.5, 总和=26968.0 [平衡解] 2. x=356, y=204.0, a*x=12994.0, b*y=13974.0, 总和=26968.0 [平衡解] 3. x=82, y=350.0, a*x=2993.0, b*y=23975.0, 总和=26968.0 [原始解] 4. x=493, y=131.0, a*x=17994.5, b*y=8973.5, 总和=26968.0 [原始解] 5. x=630, y=58.0, a*x=22995.0, b*y=3973.0, 总和=26968.0 [原始解] 4. 组合: a=36.5, b=74 (5 个有效解) 1. x=232, y=250.0, a*x=8468.0, b*y=18500.0, 总和=26968.0 [平衡解] 2. x=380, y=177.0, a*x=13870.0, b*y=13098.0, 总和=26968.0 [平衡解] 3. x=84, y=323.0, a*x=3066.0, b*y=23902.0, 总和=26968.0 [原始解] 4. x=528, y=104.0, a*x=19272.0, b*y=7696.0, 总和=26968.0 [原始解] 5. x=676, y=31.0, a*x=24674.0, b*y=2294.0, 总和=26968.0 [原始解] 5. 组合: a=36.5, b=91.5 (4 个有效解) 1. x=245, y=197.0, a*x=8942.5, b*y=18025.5, 总和=26968.0 [平衡解] 2. x=62, y=270.0, a*x=2263.0, b*y=24705.0, 总和=26968.0 [平衡解] 3. x=428, y=124.0, a*x=15622.0, b*y=11346.0, 总和=26968.0 [原始解] 4. x=611, y=51.0, a*x=22301.5, b*y=4666.5, 总和=26968.0 [原始解] 6. 组合: a=41.5, b=59 (5 个有效解) 1. x=320, y=232.0, a*x=13280.0, b*y=13688.0, 总和=26968.0 [平衡解] 2. x=202, y=315.0, a*x=8383.0, b*y=18585.0, 总和=26968.0 [平衡解] 3. x=84, y=398.0, a*x=3486.0, b*y=23482.0, 总和=26968.0 [原始解] 4. x=438, y=149.0, a*x=18177.0, b*y=8791.0, 总和=26968.0 [原始解] 5. x=556, y=66.0, a*x=23074.0, b*y=3894.0, 总和=26968.0 [原始解] 7. 组合: a=41.5, b=68.5 (5 个有效解) 1. x=290, y=218.0, a*x=12035.0, b*y=14933.0, 总和=26968.0 [平衡解] 2. x=153, y=301.0, a*x=6349.5, b*y=20618.5, 总和=26968.0 [平衡解] 3. x=16, y=384.0, a*x=664.0, b*y=26304.0, 总和=26968.0 [原始解] 4. x=427, y=135.0, a*x=17720.5, b*y=9247.5, 总和=26968.0 [原始解] 5. x=564, y=52.0, a*x=23406.0, b*y=3562.0, 总和=26968.0 [原始解] 8. 组合: a=41.5, b=74 (5 个有效解) 1. x=188, y=259.0, a*x=7802.0, b*y=19166.0, 总和=26968.0 [平衡解] 2. x=336, y=176.0, a*x=13944.0, b*y=13024.0, 总和=26968.0 [平衡解] 3. x=40, y=342.0, a*x=1660.0, b*y=25308.0, 总和=26968.0 [原始解] 4. x=484, y=93.0, a*x=20086.0, b*y=6882.0, 总和=26968.0 [原始解] 5. x=632, y=10.0, a*x=26228.0, b*y=740.0, 总和=26968.0 [原始解] 9. 组合: a=41.5, b=91.5 (3 个有效解) 1. x=178, y=214.0, a*x=7387.0, b*y=19581.0, 总和=26968.0 [平衡解] 2. x=361, y=131.0, a*x=14981.5, b*y=11986.5, 总和=26968.0 [平衡解] 3. x=544, y=48.0, a*x=22576.0, b*y=4392.0, 总和=26968.0 [原始解] 10. 组合: a=59, b=68.5 (3 个有效解) 1. x=269, y=162.0, a*x=15871.0, b*y=11097.0, 总和=26968.0 [平衡解] 2. x=132, y=280.0, a*x=7788.0, b*y=19180.0, 总和=26968.0 [平衡解] 3. x=406, y=44.0, a*x=23954.0, b*y=3014.0, 总和=26968.0 [原始解] 11. 组合: a=59, b=74 (6 个有效解) 1. x=210, y=197, a*x=12390.0, b*y=14578.0, 总和=26968.0 [平衡解] 2. x=136, y=256, a*x=8024.0, b*y=18944.0, 总和=26968.0 [平衡解] 3. x=62, y=315, a*x=3658.0, b*y=23310.0, 总和=26968.0 [原始解] 4. x=284, y=138, a*x=16756.0, b*y=10212.0, 总和=26968.0 [原始解] 5. x=358, y=79, a*x=21122.0, b*y=5846.0, 总和=26968.0 [原始解] 12. 组合: a=59, b=91.5 (2 个有效解) 1. x=119, y=218.0, a*x=7021.0, b*y=19947.0, 总和=26968.0 [平衡解] 2. x=302, y=100.0, a*x=17818.0, b*y=9150.0, 总和=26968.0 [平衡解] 13. 组合: a=68.5, b=74 (3 个有效解) 1. x=196, y=183.0, a*x=13426.0, b*y=13542.0, 总和=26968.0 [平衡解] 2. x=48, y=320.0, a*x=3288.0, b*y=23680.0, 总和=26968.0 [平衡解] 3. x=344, y=46.0, a*x=23564.0, b*y=3404.0, 总和=26968.0 [原始解] 14. 组合: a=68.5, b=91.5 (3 个有效解) 1. x=196, y=148.0, a*x=13426.0, b*y=13542.0, 总和=26968.0 [平衡解] 2. x=13, y=285.0, a*x=890.5, b*y=26077.5, 总和=26968.0 [平衡解] 3. x=379, y=11.0, a*x=25961.5, b*y=1006.5, 总和=26968.0 [原始解] 15. 组合: a=74, b=91.5 (2 个有效解) 1. x=221, y=116.0, a*x=16354.0, b*y=10614.0, 总和=26968.0 [平衡解] 2. x=38, y=264.0, a*x=2812.0, b*y=24156.0, 总和=26968.0 [平衡解] 使用基础系数列表,共找到有效解 总耗时: 0.00秒