from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET =49998 # 目标值 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
目标值: 49998 ==== 尝试基础系数 ==== 找到 15 组2变量解: 1. 组合: a=36.5, b=41.5 (16 个有效解) 1. x=641, y=641.0, a*x=23396.5, b*y=26601.5, 总和=49998.0 [平衡解] 2. x=558, y=714.0, a*x=20367.0, b*y=29631.0, 总和=49998.0 [平衡解] 3. x=60, y=1152.0, a*x=2190.0, b*y=47808.0, 总和=49998.0 [原始解] 4. x=143, y=1079.0, a*x=5219.5, b*y=44778.5, 总和=49998.0 [原始解] 5. x=226, y=1006.0, a*x=8249.0, b*y=41749.0, 总和=49998.0 [原始解] 2. 组合: a=36.5, b=59 (12 个有效解) 1. x=484, y=548.0, a*x=17666.0, b*y=32332.0, 总和=49998.0 [平衡解] 2. x=602, y=475.0, a*x=21973.0, b*y=28025.0, 总和=49998.0 [平衡解] 3. x=12, y=840.0, a*x=438.0, b*y=49560.0, 总和=49998.0 [原始解] 4. x=130, y=767.0, a*x=4745.0, b*y=45253.0, 总和=49998.0 [原始解] 5. x=248, y=694.0, a*x=9052.0, b*y=40946.0, 总和=49998.0 [原始解] 3. 组合: a=36.5, b=68.5 (10 个有效解) 1. x=484, y=472.0, a*x=17666.0, b*y=32332.0, 总和=49998.0 [平衡解] 2. x=347, y=545.0, a*x=12665.5, b*y=37332.5, 总和=49998.0 [平衡解] 3. x=73, y=691.0, a*x=2664.5, b*y=47333.5, 总和=49998.0 [原始解] 4. x=210, y=618.0, a*x=7665.0, b*y=42333.0, 总和=49998.0 [原始解] 5. x=621, y=399.0, a*x=22666.5, b*y=27331.5, 总和=49998.0 [原始解] 4. 组合: a=36.5, b=74 (9 个有效解) 1. x=496, y=431.0, a*x=18104.0, b*y=31894.0, 总和=49998.0 [平衡解] 2. x=348, y=504.0, a*x=12702.0, b*y=37296.0, 总和=49998.0 [平衡解] 3. x=52, y=650.0, a*x=1898.0, b*y=48100.0, 总和=49998.0 [原始解] 4. x=200, y=577.0, a*x=7300.0, b*y=42698.0, 总和=49998.0 [原始解] 5. x=644, y=358.0, a*x=23506.0, b*y=26492.0, 总和=49998.0 [原始解] 5. 组合: a=36.5, b=91.5 (7 个有效解) 1. x=342, y=410.0, a*x=12483.0, b*y=37515.0, 总和=49998.0 [平衡解] 2. x=525, y=337.0, a*x=19162.5, b*y=30835.5, 总和=49998.0 [平衡解] 3. x=159, y=483.0, a*x=5803.5, b*y=44194.5, 总和=49998.0 [原始解] 4. x=708, y=264.0, a*x=25842.0, b*y=24156.0, 总和=49998.0 [原始解] 5. x=891, y=191.0, a*x=32521.5, b*y=17476.5, 总和=49998.0 [原始解] 6. 组合: a=41.5, b=59 (10 个有效解) 1. x=538, y=469.0, a*x=22327.0, b*y=27671.0, 总和=49998.0 [平衡解] 2. x=420, y=552.0, a*x=17430.0, b*y=32568.0, 总和=49998.0 [平衡解] 3. x=66, y=801.0, a*x=2739.0, b*y=47259.0, 总和=49998.0 [原始解] 4. x=184, y=718.0, a*x=7636.0, b*y=42362.0, 总和=49998.0 [原始解] 5. x=302, y=635.0, a*x=12533.0, b*y=37465.0, 总和=49998.0 [原始解] 7. 组合: a=41.5, b=68.5 (9 个有效解) 1. x=462, y=450.0, a*x=19173.0, b*y=30825.0, 总和=49998.0 [平衡解] 2. x=325, y=533.0, a*x=13487.5, b*y=36510.5, 总和=49998.0 [平衡解] 3. x=51, y=699.0, a*x=2116.5, b*y=47881.5, 总和=49998.0 [原始解] 4. x=188, y=616.0, a*x=7802.0, b*y=42196.0, 总和=49998.0 [原始解] 5. x=599, y=367.0, a*x=24858.5, b*y=25139.5, 总和=49998.0 [原始解] 8. 组合: a=41.5, b=74 (8 个有效解) 1. x=504, y=393.0, a*x=20916.0, b*y=29082.0, 总和=49998.0 [平衡解] 2. x=356, y=476.0, a*x=14774.0, b*y=35224.0, 总和=49998.0 [平衡解] 3. x=60, y=642.0, a*x=2490.0, b*y=47508.0, 总和=49998.0 [原始解] 4. x=208, y=559.0, a*x=8632.0, b*y=41366.0, 总和=49998.0 [原始解] 5. x=652, y=310.0, a*x=27058.0, b*y=22940.0, 总和=49998.0 [原始解] 9. 组合: a=41.5, b=91.5 (6 个有效解) 1. x=303, y=409.0, a*x=12574.5, b*y=37423.5, 总和=49998.0 [平衡解] 2. x=486, y=326.0, a*x=20169.0, b*y=29829.0, 总和=49998.0 [平衡解] 3. x=120, y=492.0, a*x=4980.0, b*y=45018.0, 总和=49998.0 [原始解] 4. x=669, y=243.0, a*x=27763.5, b*y=22234.5, 总和=49998.0 [原始解] 5. x=852, y=160.0, a*x=35358.0, b*y=14640.0, 总和=49998.0 [原始解] 10. 组合: a=59, b=68.5 (6 个有效解) 1. x=455, y=338.0, a*x=26845.0, b*y=23153.0, 总和=49998.0 [平衡解] 2. x=318, y=456.0, a*x=18762.0, b*y=31236.0, 总和=49998.0 [平衡解] 3. x=44, y=692.0, a*x=2596.0, b*y=47402.0, 总和=49998.0 [原始解] 4. x=181, y=574.0, a*x=10679.0, b*y=39319.0, 总和=49998.0 [原始解] 5. x=592, y=220.0, a*x=34928.0, b*y=15070.0, 总和=49998.0 [原始解] 11. 组合: a=59, b=74 (11 个有效解) 1. x=352, y=395, a*x=20768.0, b*y=29230.0, 总和=49998.0 [平衡解] 2. x=426, y=336, a*x=25134.0, b*y=24864.0, 总和=49998.0 [平衡解] 3. x=56, y=631, a*x=3304.0, b*y=46694.0, 总和=49998.0 [原始解] 4. x=130, y=572, a*x=7670.0, b*y=42328.0, 总和=49998.0 [原始解] 5. x=204, y=513, a*x=12036.0, b*y=37962.0, 总和=49998.0 [原始解] 12. 组合: a=59, b=91.5 (5 个有效解) 1. x=255, y=382.0, a*x=15045.0, b*y=34953.0, 总和=49998.0 [平衡解] 2. x=438, y=264.0, a*x=25842.0, b*y=24156.0, 总和=49998.0 [平衡解] 3. x=72, y=500.0, a*x=4248.0, b*y=45750.0, 总和=49998.0 [原始解] 4. x=621, y=146.0, a*x=36639.0, b*y=13359.0, 总和=49998.0 [原始解] 5. x=804, y=28.0, a*x=47436.0, b*y=2562.0, 总和=49998.0 [原始解] 13. 组合: a=68.5, b=74 (5 个有效解) 1. x=368, y=335.0, a*x=25208.0, b*y=24790.0, 总和=49998.0 [平衡解] 2. x=220, y=472.0, a*x=15070.0, b*y=34928.0, 总和=49998.0 [平衡解] 3. x=72, y=609.0, a*x=4932.0, b*y=45066.0, 总和=49998.0 [原始解] 4. x=516, y=198.0, a*x=35346.0, b*y=14652.0, 总和=49998.0 [原始解] 5. x=664, y=61.0, a*x=45484.0, b*y=4514.0, 总和=49998.0 [原始解] 14. 组合: a=68.5, b=91.5 (4 个有效解) 1. x=237, y=369.0, a*x=16234.5, b*y=33763.5, 总和=49998.0 [平衡解] 2. x=420, y=232.0, a*x=28770.0, b*y=21228.0, 总和=49998.0 [平衡解] 3. x=54, y=506.0, a*x=3699.0, b*y=46299.0, 总和=49998.0 [原始解] 4. x=603, y=95.0, a*x=41305.5, b*y=8692.5, 总和=49998.0 [原始解] 15. 组合: a=74, b=91.5 (4 个有效解) 1. x=369, y=248.0, a*x=27306.0, b*y=22692.0, 总和=49998.0 [平衡解] 2. x=186, y=396.0, a*x=13764.0, b*y=36234.0, 总和=49998.0 [平衡解] 3. x=3, y=544.0, a*x=222.0, b*y=49776.0, 总和=49998.0 [原始解] 4. x=552, y=100.0, a*x=40848.0, b*y=9150.0, 总和=49998.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒