from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 100153 # 目标值 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
目标值: 100153 ==== 尝试基础系数 ==== 找到 11 组2变量解: 1. 组合: a=38.5, b=70.5 (9 个有效解) 1. x=805, y=981.0, a*x=30992.5, b*y=69160.5, 总和=100153.0 [平衡解] 2. x=1087, y=827.0, a*x=41849.5, b*y=58303.5, 总和=100153.0 [平衡解] 3. x=241, y=1289.0, a*x=9278.5, b*y=90874.5, 总和=100153.0 [原始解] 4. x=523, y=1135.0, a*x=20135.5, b*y=80017.5, 总和=100153.0 [原始解] 5. x=1369, y=673.0, a*x=52706.5, b*y=47446.5, 总和=100153.0 [原始解] 2. 组合: a=38.5, b=75.5 (9 个有效解) 1. x=909, y=863.0, a*x=34996.5, b*y=65156.5, 总和=100153.0 [平衡解] 2. x=607, y=1017.0, a*x=23369.5, b*y=76783.5, 总和=100153.0 [平衡解] 3. x=3, y=1325.0, a*x=115.5, b*y=100037.5, 总和=100153.0 [原始解] 4. x=305, y=1171.0, a*x=11742.5, b*y=88410.5, 总和=100153.0 [原始解] 5. x=1211, y=709.0, a*x=46623.5, b*y=53529.5, 总和=100153.0 [原始解] 3. 组合: a=44, b=61 (18 个有效解) 1. x=955, y=953, a*x=42020.0, b*y=58133.0, 总和=100153.0 [平衡解] 2. x=833, y=1041, a*x=36652.0, b*y=63501.0, 总和=100153.0 [平衡解] 3. x=101, y=1569, a*x=4444.0, b*y=95709.0, 总和=100153.0 [原始解] 4. x=223, y=1481, a*x=9812.0, b*y=90341.0, 总和=100153.0 [原始解] 5. x=345, y=1393, a*x=15180.0, b*y=84973.0, 总和=100153.0 [原始解] 4. 组合: a=44, b=70.5 (9 个有效解) 1. x=863, y=882.0, a*x=37972.0, b*y=62181.0, 总和=100153.0 [平衡解] 2. x=1145, y=706.0, a*x=50380.0, b*y=49773.0, 总和=100153.0 [平衡解] 3. x=17, y=1410.0, a*x=748.0, b*y=99405.0, 总和=100153.0 [原始解] 4. x=299, y=1234.0, a*x=13156.0, b*y=86997.0, 总和=100153.0 [原始解] 5. x=581, y=1058.0, a*x=25564.0, b*y=74589.0, 总和=100153.0 [原始解] 5. 组合: a=44, b=75.5 (8 个有效解) 1. x=701, y=918.0, a*x=30844.0, b*y=69309.0, 总和=100153.0 [平衡解] 2. x=1003, y=742.0, a*x=44132.0, b*y=56021.0, 总和=100153.0 [平衡解] 3. x=97, y=1270.0, a*x=4268.0, b*y=95885.0, 总和=100153.0 [原始解] 4. x=399, y=1094.0, a*x=17556.0, b*y=82597.0, 总和=100153.0 [原始解] 5. x=1305, y=566.0, a*x=57420.0, b*y=42733.0, 总和=100153.0 [原始解] 6. 组合: a=44, b=93 (12 个有效解) 1. x=803, y=697, a*x=35332.0, b*y=64821.0, 总和=100153.0 [平衡解] 2. x=617, y=785, a*x=27148.0, b*y=73005.0, 总和=100153.0 [平衡解] 3. x=59, y=1049, a*x=2596.0, b*y=97557.0, 总和=100153.0 [原始解] 4. x=245, y=961, a*x=10780.0, b*y=89373.0, 总和=100153.0 [原始解] 5. x=431, y=873, a*x=18964.0, b*y=81189.0, 总和=100153.0 [原始解] 7. 组合: a=61, b=70.5 (12 个有效解) 1. x=745, y=776.0, a*x=45445.0, b*y=54708.0, 总和=100153.0 [平衡解] 2. x=886, y=654.0, a*x=54046.0, b*y=46107.0, 总和=100153.0 [平衡解] 3. x=40, y=1386.0, a*x=2440.0, b*y=97713.0, 总和=100153.0 [原始解] 4. x=181, y=1264.0, a*x=11041.0, b*y=89112.0, 总和=100153.0 [原始解] 5. x=322, y=1142.0, a*x=19642.0, b*y=80511.0, 总和=100153.0 [原始解] 8. 组合: a=61, b=75.5 (11 个有效解) 1. x=721, y=744.0, a*x=43981.0, b*y=56172.0, 总和=100153.0 [平衡解] 2. x=872, y=622.0, a*x=53192.0, b*y=46961.0, 总和=100153.0 [平衡解] 3. x=117, y=1232.0, a*x=7137.0, b*y=93016.0, 总和=100153.0 [原始解] 4. x=268, y=1110.0, a*x=16348.0, b*y=83805.0, 总和=100153.0 [原始解] 5. x=419, y=988.0, a*x=25559.0, b*y=74594.0, 总和=100153.0 [原始解] 9. 组合: a=61, b=93 (17 个有效解) 1. x=628, y=665, a*x=38308.0, b*y=61845.0, 总和=100153.0 [平衡解] 2. x=721, y=604, a*x=43981.0, b*y=56172.0, 总和=100153.0 [平衡解] 3. x=70, y=1031, a*x=4270.0, b*y=95883.0, 总和=100153.0 [原始解] 4. x=163, y=970, a*x=9943.0, b*y=90210.0, 总和=100153.0 [原始解] 5. x=256, y=909, a*x=15616.0, b*y=84537.0, 总和=100153.0 [原始解] 10. 组合: a=70.5, b=75.5 (9 个有效解) 1. x=747, y=629.0, a*x=52663.5, b*y=47489.5, 总和=100153.0 [平衡解] 2. x=596, y=770.0, a*x=42018.0, b*y=58135.0, 总和=100153.0 [平衡解] 3. x=143, y=1193.0, a*x=10081.5, b*y=90071.5, 总和=100153.0 [原始解] 4. x=294, y=1052.0, a*x=20727.0, b*y=79426.0, 总和=100153.0 [原始解] 5. x=445, y=911.0, a*x=31372.5, b*y=68780.5, 总和=100153.0 [原始解] 11. 组合: a=75.5, b=93 (7 个有效解) 1. x=686, y=520.0, a*x=51793.0, b*y=48360.0, 总和=100153.0 [平衡解] 2. x=500, y=671.0, a*x=37750.0, b*y=62403.0, 总和=100153.0 [平衡解] 3. x=128, y=973.0, a*x=9664.0, b*y=90489.0, 总和=100153.0 [原始解] 4. x=314, y=822.0, a*x=23707.0, b*y=76446.0, 总和=100153.0 [原始解] 5. x=872, y=369.0, a*x=65836.0, b*y=34317.0, 总和=100153.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒