from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 29058 # 目标值 BASE_VALUES = [38.5,44,61,70.5,75.5,93] # 基础系数列表 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
目标值: 29058 ==== 尝试基础系数 ==== 找到 14 组2变量解: 1. 组合: a=38.5, b=61 (7 个有效解) 1. x=262, y=311.0, a*x=10087.0, b*y=18971.0, 总和=29058.0 [平衡解] 2. x=384, y=234.0, a*x=14784.0, b*y=14274.0, 总和=29058.0 [平衡解] 3. x=18, y=465.0, a*x=693.0, b*y=28365.0, 总和=29058.0 [原始解] 4. x=140, y=388.0, a*x=5390.0, b*y=23668.0, 总和=29058.0 [原始解] 5. x=506, y=157.0, a*x=19481.0, b*y=9577.0, 总和=29058.0 [原始解] 2. 组合: a=38.5, b=70.5 (5 个有效解) 1. x=264, y=268.0, a*x=10164.0, b*y=18894.0, 总和=29058.0 [平衡解] 2. x=405, y=191.0, a*x=15592.5, b*y=13465.5, 总和=29058.0 [平衡解] 3. x=123, y=345.0, a*x=4735.5, b*y=24322.5, 总和=29058.0 [原始解] 4. x=546, y=114.0, a*x=21021.0, b*y=8037.0, 总和=29058.0 [原始解] 5. x=687, y=37.0, a*x=26449.5, b*y=2608.5, 总和=29058.0 [原始解] 3. 组合: a=38.5, b=75.5 (5 个有效解) 1. x=239, y=263.0, a*x=9201.5, b*y=19856.5, 总和=29058.0 [平衡解] 2. x=390, y=186.0, a*x=15015.0, b*y=14043.0, 总和=29058.0 [平衡解] 3. x=88, y=340.0, a*x=3388.0, b*y=25670.0, 总和=29058.0 [原始解] 4. x=541, y=109.0, a*x=20828.5, b*y=8229.5, 总和=29058.0 [原始解] 5. x=692, y=32.0, a*x=26642.0, b*y=2416.0, 总和=29058.0 [原始解] 4. 组合: a=38.5, b=93 (4 个有效解) 1. x=204, y=228.0, a*x=7854.0, b*y=21204.0, 总和=29058.0 [平衡解] 2. x=390, y=151.0, a*x=15015.0, b*y=14043.0, 总和=29058.0 [平衡解] 3. x=18, y=305.0, a*x=693.0, b*y=28365.0, 总和=29058.0 [原始解] 4. x=576, y=74.0, a*x=22176.0, b*y=6882.0, 总和=29058.0 [原始解] 5. 组合: a=44, b=61 (11 个有效解) 1. x=275, y=278, a*x=12100.0, b*y=16958.0, 总和=29058.0 [平衡解] 2. x=336, y=234, a*x=14784.0, b*y=14274.0, 总和=29058.0 [平衡解] 3. x=31, y=454, a*x=1364.0, b*y=27694.0, 总和=29058.0 [原始解] 4. x=92, y=410, a*x=4048.0, b*y=25010.0, 总和=29058.0 [原始解] 5. x=153, y=366, a*x=6732.0, b*y=22326.0, 总和=29058.0 [原始解] 6. 组合: a=44, b=70.5 (5 个有效解) 1. x=231, y=268.0, a*x=10164.0, b*y=18894.0, 总和=29058.0 [平衡解] 2. x=372, y=180.0, a*x=16368.0, b*y=12690.0, 总和=29058.0 [平衡解] 3. x=90, y=356.0, a*x=3960.0, b*y=25098.0, 总和=29058.0 [原始解] 4. x=513, y=92.0, a*x=22572.0, b*y=6486.0, 总和=29058.0 [原始解] 5. x=654, y=4.0, a*x=28776.0, b*y=282.0, 总和=29058.0 [原始解] 7. 组合: a=44, b=75.5 (4 个有效解) 1. x=228, y=252.0, a*x=10032.0, b*y=19026.0, 总和=29058.0 [平衡解] 2. x=379, y=164.0, a*x=16676.0, b*y=12382.0, 总和=29058.0 [平衡解] 3. x=77, y=340.0, a*x=3388.0, b*y=25670.0, 总和=29058.0 [原始解] 4. x=530, y=76.0, a*x=23320.0, b*y=5738.0, 总和=29058.0 [原始解] 8. 组合: a=44, b=93 (7 个有效解) 1. x=225, y=206, a*x=9900.0, b*y=19158.0, 总和=29058.0 [平衡解] 2. x=132, y=250, a*x=5808.0, b*y=23250.0, 总和=29058.0 [平衡解] 3. x=39, y=294, a*x=1716.0, b*y=27342.0, 总和=29058.0 [原始解] 4. x=318, y=162, a*x=13992.0, b*y=15066.0, 总和=29058.0 [原始解] 5. x=411, y=118, a*x=18084.0, b*y=10974.0, 总和=29058.0 [原始解] 9. 组合: a=61, b=70.5 (4 个有效解) 1. x=162, y=272.0, a*x=9882.0, b*y=19176.0, 总和=29058.0 [平衡解] 2. x=303, y=150.0, a*x=18483.0, b*y=10575.0, 总和=29058.0 [平衡解] 3. x=21, y=394.0, a*x=1281.0, b*y=27777.0, 总和=29058.0 [原始解] 4. x=444, y=28.0, a*x=27084.0, b*y=1974.0, 总和=29058.0 [原始解] 10. 组合: a=61, b=75.5 (3 个有效解) 1. x=261, y=174.0, a*x=15921.0, b*y=13137.0, 总和=29058.0 [平衡解] 2. x=110, y=296.0, a*x=6710.0, b*y=22348.0, 总和=29058.0 [平衡解] 3. x=412, y=52.0, a*x=25132.0, b*y=3926.0, 总和=29058.0 [原始解] 11. 组合: a=61, b=93 (5 个有效解) 1. x=144, y=218, a*x=8784.0, b*y=20274.0, 总和=29058.0 [平衡解] 2. x=237, y=157, a*x=14457.0, b*y=14601.0, 总和=29058.0 [平衡解] 3. x=51, y=279, a*x=3111.0, b*y=25947.0, 总和=29058.0 [原始解] 4. x=330, y=96, a*x=20130.0, b*y=8928.0, 总和=29058.0 [原始解] 5. x=423, y=35, a*x=25803.0, b*y=3255.0, 总和=29058.0 [原始解] 12. 组合: a=70.5, b=75.5 (3 个有效解) 1. x=168, y=228.0, a*x=11844.0, b*y=17214.0, 总和=29058.0 [平衡解] 2. x=319, y=87.0, a*x=22489.5, b*y=6568.5, 总和=29058.0 [平衡解] 3. x=17, y=369.0, a*x=1198.5, b*y=27859.5, 总和=29058.0 [原始解] 13. 组合: a=70.5, b=93 (6 个有效解) 1. x=180, y=176.0, a*x=12690.0, b*y=16368.0, 总和=29058.0 [平衡解] 2. x=118, y=223.0, a*x=8319.0, b*y=20739.0, 总和=29058.0 [平衡解] 3. x=56, y=270.0, a*x=3948.0, b*y=25110.0, 总和=29058.0 [原始解] 4. x=242, y=129.0, a*x=17061.0, b*y=11997.0, 总和=29058.0 [原始解] 5. x=304, y=82.0, a*x=21432.0, b*y=7626.0, 总和=29058.0 [原始解] 14. 组合: a=75.5, b=93 (2 个有效解) 1. x=258, y=103.0, a*x=19479.0, b*y=9579.0, 总和=29058.0 [平衡解] 2. x=72, y=254.0, a*x=5436.0, b*y=23622.0, 总和=29058.0 [平衡解] 使用基础系数列表,共找到有效解 总耗时: 0.00秒