from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 188300 # 目标值 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
目标值: 188300 ==== 尝试基础系数 ==== 找到 13 组2变量解: 1. 组合: a=36.5, b=41.5 (8 个有效解) 1. x=2512, y=2328.0, a*x=91688.0, b*y=96612.0, 总和=188300.0 [平衡解] 2. x=2263, y=2547.0, a*x=82599.5, b*y=105700.5, 总和=188300.0 [平衡解] 3. x=1765, y=2985.0, a*x=64422.5, b*y=123877.5, 总和=188300.0 [原始解] 4. x=2014, y=2766.0, a*x=73511.0, b*y=114789.0, 总和=188300.0 [原始解] 5. x=2761, y=2109.0, a*x=100776.5, b*y=87523.5, 总和=188300.0 [原始解] 2. 组合: a=36.5, b=59 (6 个有效解) 1. x=2002, y=1953.0, a*x=73073.0, b*y=115227.0, 总和=188300.0 [平衡解] 2. x=1648, y=2172.0, a*x=60152.0, b*y=128148.0, 总和=188300.0 [平衡解] 3. x=2356, y=1734.0, a*x=85994.0, b*y=102306.0, 总和=188300.0 [原始解] 4. x=2710, y=1515.0, a*x=98915.0, b*y=89385.0, 总和=188300.0 [原始解] 5. x=3064, y=1296.0, a*x=111836.0, b*y=76464.0, 总和=188300.0 [原始解] 3. 组合: a=36.5, b=68.5 (5 个有效解) 1. x=1702, y=1842.0, a*x=62123.0, b*y=126177.0, 总和=188300.0 [平衡解] 2. x=2113, y=1623.0, a*x=77124.5, b*y=111175.5, 总和=188300.0 [平衡解] 3. x=2524, y=1404.0, a*x=92126.0, b*y=96174.0, 总和=188300.0 [原始解] 4. x=2935, y=1185.0, a*x=107127.5, b*y=81172.5, 总和=188300.0 [原始解] 5. x=3346, y=966.0, a*x=122129.0, b*y=66171.0, 总和=188300.0 [原始解] 4. 组合: a=36.5, b=74 (4 个有效解) 1. x=1984, y=1566.0, a*x=72416.0, b*y=115884.0, 总和=188300.0 [平衡解] 2. x=2428, y=1347.0, a*x=88622.0, b*y=99678.0, 总和=188300.0 [平衡解] 3. x=2872, y=1128.0, a*x=104828.0, b*y=83472.0, 总和=188300.0 [原始解] 4. x=3316, y=909.0, a*x=121034.0, b*y=67266.0, 总和=188300.0 [原始解] 5. 组合: a=36.5, b=91.5 (10 个有效解) 1. x=1717, y=1373.0, a*x=62670.5, b*y=125629.5, 总和=188300.0 [平衡解] 2. x=1900, y=1300.0, a*x=69350.0, b*y=118950.0, 总和=188300.0 [平衡解] 3. x=2083, y=1227.0, a*x=76029.5, b*y=112270.5, 总和=188300.0 [原始解] 4. x=2266, y=1154.0, a*x=82709.0, b*y=105591.0, 总和=188300.0 [原始解] 5. x=2449, y=1081.0, a*x=89388.5, b*y=98911.5, 总和=188300.0 [原始解] 6. 组合: a=41.5, b=59 (5 个有效解) 1. x=1984, y=1796.0, a*x=82336.0, b*y=105964.0, 总和=188300.0 [平衡解] 2. x=1630, y=2045.0, a*x=67645.0, b*y=120655.0, 总和=188300.0 [平衡解] 3. x=2338, y=1547.0, a*x=97027.0, b*y=91273.0, 总和=188300.0 [原始解] 4. x=2692, y=1298.0, a*x=111718.0, b*y=76582.0, 总和=188300.0 [原始解] 5. x=3046, y=1049.0, a*x=126409.0, b*y=61891.0, 总和=188300.0 [原始解] 7. 组合: a=41.5, b=68.5 (4 个有效解) 1. x=1525, y=1825.0, a*x=63287.5, b*y=125012.5, 总和=188300.0 [平衡解] 2. x=1936, y=1576.0, a*x=80344.0, b*y=107956.0, 总和=188300.0 [平衡解] 3. x=2347, y=1327.0, a*x=97400.5, b*y=90899.5, 总和=188300.0 [原始解] 4. x=2758, y=1078.0, a*x=114457.0, b*y=73843.0, 总和=188300.0 [原始解] 8. 组合: a=41.5, b=74 (4 个有效解) 1. x=1720, y=1580.0, a*x=71380.0, b*y=116920.0, 总和=188300.0 [平衡解] 2. x=2164, y=1331.0, a*x=89806.0, b*y=98494.0, 总和=188300.0 [平衡解] 3. x=2608, y=1082.0, a*x=108232.0, b*y=80068.0, 总和=188300.0 [原始解] 4. x=3052, y=833.0, a*x=126658.0, b*y=61642.0, 总和=188300.0 [原始解] 9. 组合: a=59, b=68.5 (5 个有效解) 1. x=1587, y=1382.0, a*x=93633.0, b*y=94667.0, 总和=188300.0 [平衡解] 2. x=1313, y=1618.0, a*x=77467.0, b*y=110833.0, 总和=188300.0 [平衡解] 3. x=1039, y=1854.0, a*x=61301.0, b*y=126999.0, 总和=188300.0 [原始解] 4. x=1861, y=1146.0, a*x=109799.0, b*y=78501.0, 总和=188300.0 [原始解] 5. x=2135, y=910.0, a*x=125965.0, b*y=62335.0, 总和=188300.0 [原始解] 10. 组合: a=59, b=91.5 (3 个有效解) 1. x=1315, y=1210.0, a*x=77585.0, b*y=110715.0, 总和=188300.0 [平衡解] 2. x=1681, y=974.0, a*x=99179.0, b*y=89121.0, 总和=188300.0 [平衡解] 3. x=2047, y=738.0, a*x=120773.0, b*y=67527.0, 总和=188300.0 [原始解] 11. 组合: a=68.5, b=74 (7 个有效解) 1. x=1324, y=1319.0, a*x=90694.0, b*y=97606.0, 总和=188300.0 [平衡解] 2. x=1176, y=1456.0, a*x=80556.0, b*y=107744.0, 总和=188300.0 [平衡解] 3. x=880, y=1730.0, a*x=60280.0, b*y=128020.0, 总和=188300.0 [原始解] 4. x=1028, y=1593.0, a*x=70418.0, b*y=117882.0, 总和=188300.0 [原始解] 5. x=1472, y=1182.0, a*x=100832.0, b*y=87468.0, 总和=188300.0 [原始解] 12. 组合: a=68.5, b=91.5 (5 个有效解) 1. x=1154, y=1194.0, a*x=79049.0, b*y=109251.0, 总和=188300.0 [平衡解] 2. x=1337, y=1057.0, a*x=91584.5, b*y=96715.5, 总和=188300.0 [平衡解] 3. x=971, y=1331.0, a*x=66513.5, b*y=121786.5, 总和=188300.0 [原始解] 4. x=1520, y=920.0, a*x=104120.0, b*y=84180.0, 总和=188300.0 [原始解] 5. x=1703, y=783.0, a*x=116655.5, b*y=71644.5, 总和=188300.0 [原始解] 13. 组合: a=74, b=91.5 (5 个有效解) 1. x=1135, y=1140.0, a*x=83990.0, b*y=104310.0, 总和=188300.0 [平衡解] 2. x=1318, y=992.0, a*x=97532.0, b*y=90768.0, 总和=188300.0 [平衡解] 3. x=952, y=1288.0, a*x=70448.0, b*y=117852.0, 总和=188300.0 [原始解] 4. x=1501, y=844.0, a*x=111074.0, b*y=77226.0, 总和=188300.0 [原始解] 5. x=1684, y=696.0, a*x=124616.0, b*y=63684.0, 总和=188300.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒