from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 80129 # 目标值 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
目标值: 80129 ==== 尝试基础系数 ==== 找到 13 组2变量解: 1. 组合: a=36.5, b=41.5 (13 个有效解) 1. x=1039, y=1017.0, a*x=37923.5, b*y=42205.5, 总和=80129.0 [平衡解] 2. x=873, y=1163.0, a*x=31864.5, b*y=48264.5, 总和=80129.0 [平衡解] 3. x=43, y=1893.0, a*x=1569.5, b*y=78559.5, 总和=80129.0 [原始解] 4. x=209, y=1747.0, a*x=7628.5, b*y=72500.5, 总和=80129.0 [原始解] 5. x=375, y=1601.0, a*x=13687.5, b*y=66441.5, 总和=80129.0 [原始解] 2. 组合: a=36.5, b=68.5 (8 个有效解) 1. x=891, y=695.0, a*x=32521.5, b*y=47607.5, 总和=80129.0 [平衡解] 2. x=617, y=841.0, a*x=22520.5, b*y=57608.5, 总和=80129.0 [平衡解] 3. x=69, y=1133.0, a*x=2518.5, b*y=77610.5, 总和=80129.0 [原始解] 4. x=343, y=987.0, a*x=12519.5, b*y=67609.5, 总和=80129.0 [原始解] 5. x=1165, y=549.0, a*x=42522.5, b*y=37606.5, 总和=80129.0 [原始解] 3. 组合: a=36.5, b=91.5 (6 个有效解) 1. x=799, y=557.0, a*x=29163.5, b*y=50965.5, 总和=80129.0 [平衡解] 2. x=433, y=703.0, a*x=15804.5, b*y=64324.5, 总和=80129.0 [平衡解] 3. x=67, y=849.0, a*x=2445.5, b*y=77683.5, 总和=80129.0 [原始解] 4. x=1165, y=411.0, a*x=42522.5, b*y=37606.5, 总和=80129.0 [原始解] 5. x=1531, y=265.0, a*x=55881.5, b*y=24247.5, 总和=80129.0 [原始解] 4. 组合: a=41.5, b=59 (16 个有效解) 1. x=802, y=794.0, a*x=33283.0, b*y=46846.0, 总和=80129.0 [平衡解] 2. x=684, y=877.0, a*x=28386.0, b*y=51743.0, 总和=80129.0 [平衡解] 3. x=94, y=1292.0, a*x=3901.0, b*y=76228.0, 总和=80129.0 [原始解] 4. x=212, y=1209.0, a*x=8798.0, b*y=71331.0, 总和=80129.0 [原始解] 5. x=330, y=1126.0, a*x=13695.0, b*y=66434.0, 总和=80129.0 [原始解] 5. 组合: a=41.5, b=68.5 (14 个有效解) 1. x=782, y=696.0, a*x=32453.0, b*y=47676.0, 总和=80129.0 [平衡解] 2. x=645, y=779.0, a*x=26767.5, b*y=53361.5, 总和=80129.0 [平衡解] 3. x=97, y=1111.0, a*x=4025.5, b*y=76103.5, 总和=80129.0 [原始解] 4. x=234, y=1028.0, a*x=9711.0, b*y=70418.0, 总和=80129.0 [原始解] 5. x=371, y=945.0, a*x=15396.5, b*y=64732.5, 总和=80129.0 [原始解] 6. 组合: a=41.5, b=74 (13 个有效解) 1. x=622, y=734.0, a*x=25813.0, b*y=54316.0, 总和=80129.0 [平衡解] 2. x=770, y=651.0, a*x=31955.0, b*y=48174.0, 总和=80129.0 [平衡解] 3. x=30, y=1066.0, a*x=1245.0, b*y=78884.0, 总和=80129.0 [原始解] 4. x=178, y=983.0, a*x=7387.0, b*y=72742.0, 总和=80129.0 [原始解] 5. x=326, y=900.0, a*x=13529.0, b*y=66600.0, 总和=80129.0 [原始解] 7. 组合: a=41.5, b=91.5 (11 个有效解) 1. x=641, y=585.0, a*x=26601.5, b*y=53527.5, 总和=80129.0 [平衡解] 2. x=458, y=668.0, a*x=19007.0, b*y=61122.0, 总和=80129.0 [平衡解] 3. x=92, y=834.0, a*x=3818.0, b*y=76311.0, 总和=80129.0 [原始解] 4. x=275, y=751.0, a*x=11412.5, b*y=68716.5, 总和=80129.0 [原始解] 5. x=824, y=502.0, a*x=34196.0, b*y=45933.0, 总和=80129.0 [原始解] 8. 组合: a=59, b=68.5 (10 个有效解) 1. x=629, y=628.0, a*x=37111.0, b*y=43018.0, 总和=80129.0 [平衡解] 2. x=492, y=746.0, a*x=29028.0, b*y=51101.0, 总和=80129.0 [平衡解] 3. x=81, y=1100.0, a*x=4779.0, b*y=75350.0, 总和=80129.0 [原始解] 4. x=218, y=982.0, a*x=12862.0, b*y=67267.0, 总和=80129.0 [原始解] 5. x=355, y=864.0, a*x=20945.0, b*y=59184.0, 总和=80129.0 [原始解] 9. 组合: a=59, b=74 (18 个有效解) 1. x=583, y=618, a*x=34397.0, b*y=45732.0, 总和=80129.0 [平衡解] 2. x=657, y=559, a*x=38763.0, b*y=41366.0, 总和=80129.0 [平衡解] 3. x=65, y=1031, a*x=3835.0, b*y=76294.0, 总和=80129.0 [原始解] 4. x=139, y=972, a*x=8201.0, b*y=71928.0, 总和=80129.0 [原始解] 5. x=213, y=913, a*x=12567.0, b*y=67562.0, 总和=80129.0 [原始解] 10. 组合: a=59, b=91.5 (8 个有效解) 1. x=592, y=494.0, a*x=34928.0, b*y=45201.0, 总和=80129.0 [平衡解] 2. x=409, y=612.0, a*x=24131.0, b*y=55998.0, 总和=80129.0 [平衡解] 3. x=43, y=848.0, a*x=2537.0, b*y=77592.0, 总和=80129.0 [原始解] 4. x=226, y=730.0, a*x=13334.0, b*y=66795.0, 总和=80129.0 [原始解] 5. x=775, y=376.0, a*x=45725.0, b*y=34404.0, 总和=80129.0 [原始解] 11. 组合: a=68.5, b=74 (8 个有效解) 1. x=554, y=570.0, a*x=37949.0, b*y=42180.0, 总和=80129.0 [平衡解] 2. x=702, y=433.0, a*x=48087.0, b*y=32042.0, 总和=80129.0 [平衡解] 3. x=110, y=981.0, a*x=7535.0, b*y=72594.0, 总和=80129.0 [原始解] 4. x=258, y=844.0, a*x=17673.0, b*y=62456.0, 总和=80129.0 [原始解] 5. x=406, y=707.0, a*x=27811.0, b*y=52318.0, 总和=80129.0 [原始解] 12. 组合: a=68.5, b=91.5 (7 个有效解) 1. x=566, y=452.0, a*x=38771.0, b*y=41358.0, 总和=80129.0 [平衡解] 2. x=383, y=589.0, a*x=26235.5, b*y=53893.5, 总和=80129.0 [平衡解] 3. x=17, y=863.0, a*x=1164.5, b*y=78964.5, 总和=80129.0 [原始解] 4. x=200, y=726.0, a*x=13700.0, b*y=66429.0, 总和=80129.0 [原始解] 5. x=749, y=315.0, a*x=51306.5, b*y=28822.5, 总和=80129.0 [原始解] 13. 组合: a=74, b=91.5 (6 个有效解) 1. x=472, y=494.0, a*x=34928.0, b*y=45201.0, 总和=80129.0 [平衡解] 2. x=655, y=346.0, a*x=48470.0, b*y=31659.0, 总和=80129.0 [平衡解] 3. x=106, y=790.0, a*x=7844.0, b*y=72285.0, 总和=80129.0 [原始解] 4. x=289, y=642.0, a*x=21386.0, b*y=58743.0, 总和=80129.0 [原始解] 5. x=838, y=198.0, a*x=62012.0, b*y=18117.0, 总和=80129.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒