from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 152573 # 目标值 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
目标值: 152573 ==== 尝试基础系数 ==== 找到 14 组2变量解: 1. 组合: a=36.5, b=41.5 (12 个有效解) 1. x=2038, y=1884.0, a*x=74387.0, b*y=78186.0, 总和=152573.0 [平衡解] 2. x=1789, y=2103.0, a*x=65298.5, b*y=87274.5, 总和=152573.0 [平衡解] 3. x=793, y=2979.0, a*x=28944.5, b*y=123628.5, 总和=152573.0 [原始解] 4. x=1042, y=2760.0, a*x=38033.0, b*y=114540.0, 总和=152573.0 [原始解] 5. x=1291, y=2541.0, a*x=47121.5, b*y=105451.5, 总和=152573.0 [原始解] 2. 组合: a=36.5, b=59 (8 个有效解) 1. x=1576, y=1611.0, a*x=57524.0, b*y=95049.0, 总和=152573.0 [平衡解] 2. x=1930, y=1392.0, a*x=70445.0, b*y=82128.0, 总和=152573.0 [平衡解] 3. x=868, y=2049.0, a*x=31682.0, b*y=120891.0, 总和=152573.0 [原始解] 4. x=1222, y=1830.0, a*x=44603.0, b*y=107970.0, 总和=152573.0 [原始解] 5. x=2284, y=1173.0, a*x=83366.0, b*y=69207.0, 总和=152573.0 [原始解] 3. 组合: a=36.5, b=68.5 (7 个有效解) 1. x=1624, y=1362.0, a*x=59276.0, b*y=93297.0, 总和=152573.0 [平衡解] 2. x=1213, y=1581.0, a*x=44274.5, b*y=108298.5, 总和=152573.0 [平衡解] 3. x=802, y=1800.0, a*x=29273.0, b*y=123300.0, 总和=152573.0 [原始解] 4. x=2035, y=1143.0, a*x=74277.5, b*y=78295.5, 总和=152573.0 [原始解] 5. x=2446, y=924.0, a*x=89279.0, b*y=63294.0, 总和=152573.0 [原始解] 4. 组合: a=36.5, b=74 (6 个有效解) 1. x=1510, y=1317.0, a*x=55115.0, b*y=97458.0, 总和=152573.0 [平衡解] 2. x=1066, y=1536.0, a*x=38909.0, b*y=113664.0, 总和=152573.0 [平衡解] 3. x=1954, y=1098.0, a*x=71321.0, b*y=81252.0, 总和=152573.0 [原始解] 4. x=2398, y=879.0, a*x=87527.0, b*y=65046.0, 总和=152573.0 [原始解] 5. x=2842, y=660.0, a*x=103733.0, b*y=48840.0, 总和=152573.0 [原始解] 5. 组合: a=36.5, b=91.5 (16 个有效解) 1. x=1222, y=1180.0, a*x=44603.0, b*y=107970.0, 总和=152573.0 [平衡解] 2. x=1039, y=1253.0, a*x=37923.5, b*y=114649.5, 总和=152573.0 [平衡解] 3. x=673, y=1399.0, a*x=24564.5, b*y=128008.5, 总和=152573.0 [原始解] 4. x=856, y=1326.0, a*x=31244.0, b*y=121329.0, 总和=152573.0 [原始解] 5. x=1405, y=1107.0, a*x=51282.5, b*y=101290.5, 总和=152573.0 [原始解] 6. 组合: a=41.5, b=59 (7 个有效解) 1. x=1588, y=1469.0, a*x=65902.0, b*y=86671.0, 总和=152573.0 [平衡解] 2. x=1234, y=1718.0, a*x=51211.0, b*y=101362.0, 总和=152573.0 [平衡解] 3. x=880, y=1967.0, a*x=36520.0, b*y=116053.0, 总和=152573.0 [原始解] 4. x=1942, y=1220.0, a*x=80593.0, b*y=71980.0, 总和=152573.0 [原始解] 5. x=2296, y=971.0, a*x=95284.0, b*y=57289.0, 总和=152573.0 [原始解] 7. 组合: a=41.5, b=68.5 (6 个有效解) 1. x=1189, y=1507.0, a*x=49343.5, b*y=103229.5, 总和=152573.0 [平衡解] 2. x=1600, y=1258.0, a*x=66400.0, b*y=86173.0, 总和=152573.0 [平衡解] 3. x=778, y=1756.0, a*x=32287.0, b*y=120286.0, 总和=152573.0 [原始解] 4. x=2011, y=1009.0, a*x=83456.5, b*y=69116.5, 总和=152573.0 [原始解] 5. x=2422, y=760.0, a*x=100513.0, b*y=52060.0, 总和=152573.0 [原始解] 8. 组合: a=41.5, b=74 (5 个有效解) 1. x=1378, y=1289.0, a*x=57187.0, b*y=95386.0, 总和=152573.0 [平衡解] 2. x=934, y=1538.0, a*x=38761.0, b*y=113812.0, 总和=152573.0 [平衡解] 3. x=1822, y=1040.0, a*x=75613.0, b*y=76960.0, 总和=152573.0 [原始解] 4. x=2266, y=791.0, a*x=94039.0, b*y=58534.0, 总和=152573.0 [原始解] 5. x=2710, y=542.0, a*x=112465.0, b*y=40108.0, 总和=152573.0 [原始解] 9. 组合: a=59, b=68.5 (7 个有效解) 1. x=1281, y=1124.0, a*x=75579.0, b*y=76994.0, 总和=152573.0 [平衡解] 2. x=1007, y=1360.0, a*x=59413.0, b*y=93160.0, 总和=152573.0 [平衡解] 3. x=459, y=1832.0, a*x=27081.0, b*y=125492.0, 总和=152573.0 [原始解] 4. x=733, y=1596.0, a*x=43247.0, b*y=109326.0, 总和=152573.0 [原始解] 5. x=1555, y=888.0, a*x=91745.0, b*y=60828.0, 总和=152573.0 [原始解] 10. 组合: a=59, b=74 (24 个有效解) 1. x=1111, y=1176, a*x=65549.0, b*y=87024.0, 总和=152573.0 [平衡解] 2. x=1185, y=1117, a*x=69915.0, b*y=82658.0, 总和=152573.0 [平衡解] 3. x=445, y=1707, a*x=26255.0, b*y=126318.0, 总和=152573.0 [原始解] 4. x=519, y=1648, a*x=30621.0, b*y=121952.0, 总和=152573.0 [原始解] 5. x=593, y=1589, a*x=34987.0, b*y=117586.0, 总和=152573.0 [原始解] 11. 组合: a=59, b=91.5 (5 个有效解) 1. x=1153, y=924.0, a*x=68027.0, b*y=84546.0, 总和=152573.0 [平衡解] 2. x=787, y=1160.0, a*x=46433.0, b*y=106140.0, 总和=152573.0 [平衡解] 3. x=421, y=1396.0, a*x=24839.0, b*y=127734.0, 总和=152573.0 [原始解] 4. x=1519, y=688.0, a*x=89621.0, b*y=62952.0, 总和=152573.0 [原始解] 5. x=1885, y=452.0, a*x=111215.0, b*y=41358.0, 总和=152573.0 [原始解] 12. 组合: a=68.5, b=74 (11 个有效解) 1. x=1106, y=1038.0, a*x=75761.0, b*y=76812.0, 总和=152573.0 [平衡解] 2. x=958, y=1175.0, a*x=65623.0, b*y=86950.0, 总和=152573.0 [平衡解] 3. x=366, y=1723.0, a*x=25071.0, b*y=127502.0, 总和=152573.0 [原始解] 4. x=514, y=1586.0, a*x=35209.0, b*y=117364.0, 总和=152573.0 [原始解] 5. x=662, y=1449.0, a*x=45347.0, b*y=107226.0, 总和=152573.0 [原始解] 13. 组合: a=68.5, b=91.5 (9 个有效解) 1. x=941, y=963.0, a*x=64458.5, b*y=88114.5, 总和=152573.0 [平衡解] 2. x=1124, y=826.0, a*x=76994.0, b*y=75579.0, 总和=152573.0 [平衡解] 3. x=392, y=1374.0, a*x=26852.0, b*y=125721.0, 总和=152573.0 [原始解] 4. x=575, y=1237.0, a*x=39387.5, b*y=113185.5, 总和=152573.0 [原始解] 5. x=758, y=1100.0, a*x=51923.0, b*y=100650.0, 总和=152573.0 [原始解] 14. 组合: a=74, b=91.5 (8 个有效解) 1. x=991, y=866.0, a*x=73334.0, b*y=79239.0, 总和=152573.0 [平衡解] 2. x=808, y=1014.0, a*x=59792.0, b*y=92781.0, 总和=152573.0 [平衡解] 3. x=442, y=1310.0, a*x=32708.0, b*y=119865.0, 总和=152573.0 [原始解] 4. x=625, y=1162.0, a*x=46250.0, b*y=106323.0, 总和=152573.0 [原始解] 5. x=1174, y=718.0, a*x=86876.0, b*y=65697.0, 总和=152573.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒