from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 110560 # 目标值 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
目标值: 110560 ==== 尝试基础系数 ==== 找到 11 组2变量解: 1. 组合: a=38.5, b=70.5 (10 个有效解) 1. x=1057, y=991.0, a*x=40694.5, b*y=69865.5, 总和=110560.0 [平衡解] 2. x=775, y=1145.0, a*x=29837.5, b*y=80722.5, 总和=110560.0 [平衡解] 3. x=211, y=1453.0, a*x=8123.5, b*y=102436.5, 总和=110560.0 [原始解] 4. x=493, y=1299.0, a*x=18980.5, b*y=91579.5, 总和=110560.0 [原始解] 5. x=1339, y=837.0, a*x=51551.5, b*y=59008.5, 总和=110560.0 [原始解] 2. 组合: a=38.5, b=75.5 (9 个有效解) 1. x=893, y=1009.0, a*x=34380.5, b*y=76179.5, 总和=110560.0 [平衡解] 2. x=1195, y=855.0, a*x=46007.5, b*y=64552.5, 总和=110560.0 [平衡解] 3. x=289, y=1317.0, a*x=11126.5, b*y=99433.5, 总和=110560.0 [原始解] 4. x=591, y=1163.0, a*x=22753.5, b*y=87806.5, 总和=110560.0 [原始解] 5. x=1497, y=701.0, a*x=57634.5, b*y=52925.5, 总和=110560.0 [原始解] 3. 组合: a=44, b=61 (21 个有效解) 1. x=1021, y=1076, a*x=44924.0, b*y=65636.0, 总和=110560.0 [平衡解] 2. x=1143, y=988, a*x=50292.0, b*y=60268.0, 总和=110560.0 [平衡解] 3. x=45, y=1780, a*x=1980.0, b*y=108580.0, 总和=110560.0 [原始解] 4. x=167, y=1692, a*x=7348.0, b*y=103212.0, 总和=110560.0 [原始解] 5. x=289, y=1604, a*x=12716.0, b*y=97844.0, 总和=110560.0 [原始解] 4. 组合: a=44, b=70.5 (9 个有效解) 1. x=1013, y=936.0, a*x=44572.0, b*y=65988.0, 总和=110560.0 [平衡解] 2. x=731, y=1112.0, a*x=32164.0, b*y=78396.0, 总和=110560.0 [平衡解] 3. x=167, y=1464.0, a*x=7348.0, b*y=103212.0, 总和=110560.0 [原始解] 4. x=449, y=1288.0, a*x=19756.0, b*y=90804.0, 总和=110560.0 [原始解] 5. x=1295, y=760.0, a*x=56980.0, b*y=53580.0, 总和=110560.0 [原始解] 5. 组合: a=44, b=75.5 (9 个有效解) 1. x=989, y=888.0, a*x=43516.0, b*y=67044.0, 总和=110560.0 [平衡解] 2. x=687, y=1064.0, a*x=30228.0, b*y=80332.0, 总和=110560.0 [平衡解] 3. x=83, y=1416.0, a*x=3652.0, b*y=106908.0, 总和=110560.0 [原始解] 4. x=385, y=1240.0, a*x=16940.0, b*y=93620.0, 总和=110560.0 [原始解] 5. x=1291, y=712.0, a*x=56804.0, b*y=53756.0, 总和=110560.0 [原始解] 6. 组合: a=44, b=93 (13 个有效解) 1. x=881, y=772, a*x=38764.0, b*y=71796.0, 总和=110560.0 [平衡解] 2. x=695, y=860, a*x=30580.0, b*y=79980.0, 总和=110560.0 [平衡解] 3. x=137, y=1124, a*x=6028.0, b*y=104532.0, 总和=110560.0 [原始解] 4. x=323, y=1036, a*x=14212.0, b*y=96348.0, 总和=110560.0 [原始解] 5. x=509, y=948, a*x=22396.0, b*y=88164.0, 总和=110560.0 [原始解] 7. 组合: a=61, b=70.5 (13 个有效解) 1. x=874, y=812.0, a*x=53314.0, b*y=57246.0, 总和=110560.0 [平衡解] 2. x=733, y=934.0, a*x=44713.0, b*y=65847.0, 总和=110560.0 [平衡解] 3. x=28, y=1544.0, a*x=1708.0, b*y=108852.0, 总和=110560.0 [原始解] 4. x=169, y=1422.0, a*x=10309.0, b*y=100251.0, 总和=110560.0 [原始解] 5. x=310, y=1300.0, a*x=18910.0, b*y=91650.0, 总和=110560.0 [原始解] 8. 组合: a=61, b=75.5 (12 个有效解) 1. x=852, y=776.0, a*x=51972.0, b*y=58588.0, 总和=110560.0 [平衡解] 2. x=701, y=898.0, a*x=42761.0, b*y=67799.0, 总和=110560.0 [平衡解] 3. x=97, y=1386.0, a*x=5917.0, b*y=104643.0, 总和=110560.0 [原始解] 4. x=248, y=1264.0, a*x=15128.0, b*y=95432.0, 总和=110560.0 [原始解] 5. x=399, y=1142.0, a*x=24339.0, b*y=86221.0, 总和=110560.0 [原始解] 9. 组合: a=61, b=93 (19 个有效解) 1. x=730, y=710, a*x=44530.0, b*y=66030.0, 总和=110560.0 [平衡解] 2. x=637, y=771, a*x=38857.0, b*y=71703.0, 总和=110560.0 [平衡解] 3. x=79, y=1137, a*x=4819.0, b*y=105741.0, 总和=110560.0 [原始解] 4. x=172, y=1076, a*x=10492.0, b*y=100068.0, 总和=110560.0 [原始解] 5. x=265, y=1015, a*x=16165.0, b*y=94395.0, 总和=110560.0 [原始解] 10. 组合: a=70.5, b=75.5 (10 个有效解) 1. x=689, y=821.0, a*x=48574.5, b*y=61985.5, 总和=110560.0 [平衡解] 2. x=840, y=680.0, a*x=59220.0, b*y=51340.0, 总和=110560.0 [平衡解] 3. x=85, y=1385.0, a*x=5992.5, b*y=104567.5, 总和=110560.0 [原始解] 4. x=236, y=1244.0, a*x=16638.0, b*y=93922.0, 总和=110560.0 [原始解] 5. x=387, y=1103.0, a*x=27283.5, b*y=83276.5, 总和=110560.0 [原始解] 11. 组合: a=75.5, b=93 (8 个有效解) 1. x=644, y=666.0, a*x=48622.0, b*y=61938.0, 总和=110560.0 [平衡解] 2. x=830, y=515.0, a*x=62665.0, b*y=47895.0, 总和=110560.0 [平衡解] 3. x=86, y=1119.0, a*x=6493.0, b*y=104067.0, 总和=110560.0 [原始解] 4. x=272, y=968.0, a*x=20536.0, b*y=90024.0, 总和=110560.0 [原始解] 5. x=458, y=817.0, a*x=34579.0, b*y=75981.0, 总和=110560.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.02秒