from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET =40000 # 目标值 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
目标值: 40000 ==== 尝试基础系数 ==== 找到 15 组2变量解: 1. 组合: a=36.5, b=41.5 (13 个有效解) 1. x=549, y=481.0, a*x=20038.5, b*y=19961.5, 总和=40000.0 [平衡解] 2. x=466, y=554.0, a*x=17009.0, b*y=22991.0, 总和=40000.0 [平衡解] 3. x=51, y=919.0, a*x=1861.5, b*y=38138.5, 总和=40000.0 [原始解] 4. x=134, y=846.0, a*x=4891.0, b*y=35109.0, 总和=40000.0 [原始解] 5. x=217, y=773.0, a*x=7920.5, b*y=32079.5, 总和=40000.0 [原始解] 2. 组合: a=36.5, b=59 (9 个有效解) 1. x=438, y=407.0, a*x=15987.0, b*y=24013.0, 总和=40000.0 [平衡解] 2. x=320, y=480.0, a*x=11680.0, b*y=28320.0, 总和=40000.0 [平衡解] 3. x=84, y=626.0, a*x=3066.0, b*y=36934.0, 总和=40000.0 [原始解] 4. x=202, y=553.0, a*x=7373.0, b*y=32627.0, 总和=40000.0 [原始解] 5. x=556, y=334.0, a*x=20294.0, b*y=19706.0, 总和=40000.0 [原始解] 3. 组合: a=36.5, b=68.5 (8 个有效解) 1. x=394, y=374.0, a*x=14381.0, b*y=25619.0, 总和=40000.0 [平衡解] 2. x=257, y=447.0, a*x=9380.5, b*y=30619.5, 总和=40000.0 [平衡解] 3. x=120, y=520.0, a*x=4380.0, b*y=35620.0, 总和=40000.0 [原始解] 4. x=531, y=301.0, a*x=19381.5, b*y=20618.5, 总和=40000.0 [原始解] 5. x=668, y=228.0, a*x=24382.0, b*y=15618.0, 总和=40000.0 [原始解] 4. 组合: a=36.5, b=74 (7 个有效解) 1. x=364, y=361.0, a*x=13286.0, b*y=26714.0, 总和=40000.0 [平衡解] 2. x=216, y=434.0, a*x=7884.0, b*y=32116.0, 总和=40000.0 [平衡解] 3. x=68, y=507.0, a*x=2482.0, b*y=37518.0, 总和=40000.0 [原始解] 4. x=512, y=288.0, a*x=18688.0, b*y=21312.0, 总和=40000.0 [原始解] 5. x=660, y=215.0, a*x=24090.0, b*y=15910.0, 总和=40000.0 [原始解] 5. 组合: a=36.5, b=91.5 (6 个有效解) 1. x=221, y=349.0, a*x=8066.5, b*y=31933.5, 总和=40000.0 [平衡解] 2. x=404, y=276.0, a*x=14746.0, b*y=25254.0, 总和=40000.0 [平衡解] 3. x=38, y=422.0, a*x=1387.0, b*y=38613.0, 总和=40000.0 [原始解] 4. x=587, y=203.0, a*x=21425.5, b*y=18574.5, 总和=40000.0 [原始解] 5. x=770, y=130.0, a*x=28105.0, b*y=11895.0, 总和=40000.0 [原始解] 6. 组合: a=41.5, b=59 (8 个有效解) 1. x=344, y=436.0, a*x=14276.0, b*y=25724.0, 总和=40000.0 [平衡解] 2. x=462, y=353.0, a*x=19173.0, b*y=20827.0, 总和=40000.0 [平衡解] 3. x=108, y=602.0, a*x=4482.0, b*y=35518.0, 总和=40000.0 [原始解] 4. x=226, y=519.0, a*x=9379.0, b*y=30621.0, 总和=40000.0 [原始解] 5. x=580, y=270.0, a*x=24070.0, b*y=15930.0, 总和=40000.0 [原始解] 7. 组合: a=41.5, b=68.5 (7 个有效解) 1. x=401, y=341.0, a*x=16641.5, b*y=23358.5, 总和=40000.0 [平衡解] 2. x=264, y=424.0, a*x=10956.0, b*y=29044.0, 总和=40000.0 [平衡解] 3. x=127, y=507.0, a*x=5270.5, b*y=34729.5, 总和=40000.0 [原始解] 4. x=538, y=258.0, a*x=22327.0, b*y=17673.0, 总和=40000.0 [原始解] 5. x=675, y=175.0, a*x=28012.5, b*y=11987.5, 总和=40000.0 [原始解] 8. 组合: a=41.5, b=74 (6 个有效解) 1. x=420, y=305.0, a*x=17430.0, b*y=22570.0, 总和=40000.0 [平衡解] 2. x=272, y=388.0, a*x=11288.0, b*y=28712.0, 总和=40000.0 [平衡解] 3. x=124, y=471.0, a*x=5146.0, b*y=34854.0, 总和=40000.0 [原始解] 4. x=568, y=222.0, a*x=23572.0, b*y=16428.0, 总和=40000.0 [原始解] 5. x=716, y=139.0, a*x=29714.0, b*y=10286.0, 总和=40000.0 [原始解] 9. 组合: a=41.5, b=91.5 (5 个有效解) 1. x=298, y=302.0, a*x=12367.0, b*y=27633.0, 总和=40000.0 [平衡解] 2. x=481, y=219.0, a*x=19961.5, b*y=20038.5, 总和=40000.0 [平衡解] 3. x=115, y=385.0, a*x=4772.5, b*y=35227.5, 总和=40000.0 [原始解] 4. x=664, y=136.0, a*x=27556.0, b*y=12444.0, 总和=40000.0 [原始解] 5. x=847, y=53.0, a*x=35150.5, b*y=4849.5, 总和=40000.0 [原始解] 10. 组合: a=59, b=68.5 (5 个有效解) 1. x=260, y=360.0, a*x=15340.0, b*y=24660.0, 总和=40000.0 [平衡解] 2. x=397, y=242.0, a*x=23423.0, b*y=16577.0, 总和=40000.0 [平衡解] 3. x=123, y=478.0, a*x=7257.0, b*y=32743.0, 总和=40000.0 [原始解] 4. x=534, y=124.0, a*x=31506.0, b*y=8494.0, 总和=40000.0 [原始解] 5. x=671, y=6.0, a*x=39589.0, b*y=411.0, 总和=40000.0 [原始解] 11. 组合: a=59, b=74 (9 个有效解) 1. x=318, y=287, a*x=18762.0, b*y=21238.0, 总和=40000.0 [平衡解] 2. x=244, y=346, a*x=14396.0, b*y=25604.0, 总和=40000.0 [平衡解] 3. x=22, y=523, a*x=1298.0, b*y=38702.0, 总和=40000.0 [原始解] 4. x=96, y=464, a*x=5664.0, b*y=34336.0, 总和=40000.0 [原始解] 5. x=170, y=405, a*x=10030.0, b*y=29970.0, 总和=40000.0 [原始解] 12. 组合: a=59, b=91.5 (4 个有效解) 1. x=191, y=314.0, a*x=11269.0, b*y=28731.0, 总和=40000.0 [平衡解] 2. x=374, y=196.0, a*x=22066.0, b*y=17934.0, 总和=40000.0 [平衡解] 3. x=8, y=432.0, a*x=472.0, b*y=39528.0, 总和=40000.0 [原始解] 4. x=557, y=78.0, a*x=32863.0, b*y=7137.0, 总和=40000.0 [原始解] 13. 组合: a=68.5, b=74 (4 个有效解) 1. x=208, y=348.0, a*x=14248.0, b*y=25752.0, 总和=40000.0 [平衡解] 2. x=356, y=211.0, a*x=24386.0, b*y=15614.0, 总和=40000.0 [平衡解] 3. x=60, y=485.0, a*x=4110.0, b*y=35890.0, 总和=40000.0 [原始解] 4. x=504, y=74.0, a*x=34524.0, b*y=5476.0, 总和=40000.0 [原始解] 14. 组合: a=68.5, b=91.5 (3 个有效解) 1. x=250, y=250.0, a*x=17125.0, b*y=22875.0, 总和=40000.0 [平衡解] 2. x=67, y=387.0, a*x=4589.5, b*y=35410.5, 总和=40000.0 [平衡解] 3. x=433, y=113.0, a*x=29660.5, b*y=10339.5, 总和=40000.0 [原始解] 15. 组合: a=74, b=91.5 (3 个有效解) 1. x=224, y=256.0, a*x=16576.0, b*y=23424.0, 总和=40000.0 [平衡解] 2. x=407, y=108.0, a*x=30118.0, b*y=9882.0, 总和=40000.0 [平衡解] 3. x=41, y=404.0, a*x=3034.0, b*y=36966.0, 总和=40000.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒