from itertools import combinations import time import threading from collections import defaultdict import math from multiprocessing import Pool # 配置参数(优化阈值) TARGET = 195094 # 目标值 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
目标值: 195094 ==== 尝试基础系数 ==== 找到 13 组2变量解: 1. 组合: a=36.5, b=41.5 (7 个有效解) 1. x=2614, y=2402.0, a*x=95411.0, b*y=99683.0, 总和=195094.0 [平衡解] 2. x=2365, y=2621.0, a*x=86322.5, b*y=108771.5, 总和=195094.0 [平衡解] 3. x=1867, y=3059.0, a*x=68145.5, b*y=126948.5, 总和=195094.0 [原始解] 4. x=2116, y=2840.0, a*x=77234.0, b*y=117860.0, 总和=195094.0 [原始解] 5. x=2863, y=2183.0, a*x=104499.5, b*y=90594.5, 总和=195094.0 [原始解] 2. 组合: a=36.5, b=59 (5 个有效解) 1. x=1978, y=2083.0, a*x=72197.0, b*y=122897.0, 总和=195094.0 [平衡解] 2. x=2332, y=1864.0, a*x=85118.0, b*y=109976.0, 总和=195094.0 [平衡解] 3. x=2686, y=1645.0, a*x=98039.0, b*y=97055.0, 总和=195094.0 [原始解] 4. x=3040, y=1426.0, a*x=110960.0, b*y=84134.0, 总和=195094.0 [原始解] 5. x=3394, y=1207.0, a*x=123881.0, b*y=71213.0, 总和=195094.0 [原始解] 3. 组合: a=36.5, b=68.5 (4 个有效解) 1. x=2149, y=1703.0, a*x=78438.5, b*y=116655.5, 总和=195094.0 [平衡解] 2. x=2560, y=1484.0, a*x=93440.0, b*y=101654.0, 总和=195094.0 [平衡解] 3. x=2971, y=1265.0, a*x=108441.5, b*y=86652.5, 总和=195094.0 [原始解] 4. x=3382, y=1046.0, a*x=123443.0, b*y=71651.0, 总和=195094.0 [原始解] 4. 组合: a=36.5, b=74 (4 个有效解) 1. x=1864, y=1717.0, a*x=68036.0, b*y=127058.0, 总和=195094.0 [平衡解] 2. x=2308, y=1498.0, a*x=84242.0, b*y=110852.0, 总和=195094.0 [平衡解] 3. x=2752, y=1279.0, a*x=100448.0, b*y=94646.0, 总和=195094.0 [原始解] 4. x=3196, y=1060.0, a*x=116654.0, b*y=78440.0, 总和=195094.0 [原始解] 5. 组合: a=41.5, b=59 (4 个有效解) 1. x=1852, y=2004.0, a*x=76858.0, b*y=118236.0, 总和=195094.0 [平衡解] 2. x=2206, y=1755.0, a*x=91549.0, b*y=103545.0, 总和=195094.0 [平衡解] 3. x=2560, y=1506.0, a*x=106240.0, b*y=88854.0, 总和=195094.0 [原始解] 4. x=2914, y=1257.0, a*x=120931.0, b*y=74163.0, 总和=195094.0 [原始解] 6. 组合: a=41.5, b=68.5 (3 个有效解) 1. x=1933, y=1677.0, a*x=80219.5, b*y=114874.5, 总和=195094.0 [平衡解] 2. x=2344, y=1428.0, a*x=97276.0, b*y=97818.0, 总和=195094.0 [平衡解] 3. x=2755, y=1179.0, a*x=114332.5, b*y=80761.5, 总和=195094.0 [原始解] 7. 组合: a=41.5, b=74 (4 个有效解) 1. x=1684, y=1692.0, a*x=69886.0, b*y=125208.0, 总和=195094.0 [平衡解] 2. x=2128, y=1443.0, a*x=88312.0, b*y=106782.0, 总和=195094.0 [平衡解] 3. x=2572, y=1194.0, a*x=106738.0, b*y=88356.0, 总和=195094.0 [原始解] 4. x=3016, y=945.0, a*x=125164.0, b*y=69930.0, 总和=195094.0 [原始解] 8. 组合: a=41.5, b=91.5 (8 个有效解) 1. x=1654, y=1382.0, a*x=68641.0, b*y=126453.0, 总和=195094.0 [平衡解] 2. x=1837, y=1299.0, a*x=76235.5, b*y=118858.5, 总和=195094.0 [平衡解] 3. x=2020, y=1216.0, a*x=83830.0, b*y=111264.0, 总和=195094.0 [原始解] 4. x=2203, y=1133.0, a*x=91424.5, b*y=103669.5, 总和=195094.0 [原始解] 5. x=2386, y=1050.0, a*x=99019.0, b*y=96075.0, 总和=195094.0 [原始解] 9. 组合: a=59, b=68.5 (3 个有效解) 1. x=1665, y=1414.0, a*x=98235.0, b*y=96859.0, 总和=195094.0 [平衡解] 2. x=1391, y=1650.0, a*x=82069.0, b*y=113025.0, 总和=195094.0 [平衡解] 3. x=1939, y=1178.0, a*x=114401.0, b*y=80693.0, 总和=195094.0 [原始解] 10. 组合: a=59, b=91.5 (3 个有效解) 1. x=1151, y=1390.0, a*x=67909.0, b*y=127185.0, 总和=195094.0 [平衡解] 2. x=1517, y=1154.0, a*x=89503.0, b*y=105591.0, 总和=195094.0 [平衡解] 3. x=1883, y=918.0, a*x=111097.0, b*y=83997.0, 总和=195094.0 [原始解] 11. 组合: a=68.5, b=74 (6 个有效解) 1. x=1340, y=1396.0, a*x=91790.0, b*y=103304.0, 总和=195094.0 [平衡解] 2. x=1488, y=1259.0, a*x=101928.0, b*y=93166.0, 总和=195094.0 [平衡解] 3. x=1044, y=1670.0, a*x=71514.0, b*y=123580.0, 总和=195094.0 [原始解] 4. x=1192, y=1533.0, a*x=81652.0, b*y=113442.0, 总和=195094.0 [原始解] 5. x=1636, y=1122.0, a*x=112066.0, b*y=83028.0, 总和=195094.0 [原始解] 12. 组合: a=68.5, b=91.5 (5 个有效解) 1. x=1153, y=1269.0, a*x=78980.5, b*y=116113.5, 总和=195094.0 [平衡解] 2. x=1336, y=1132.0, a*x=91516.0, b*y=103578.0, 总和=195094.0 [平衡解] 3. x=970, y=1406.0, a*x=66445.0, b*y=128649.0, 总和=195094.0 [原始解] 4. x=1519, y=995.0, a*x=104051.5, b*y=91042.5, 总和=195094.0 [原始解] 5. x=1702, y=858.0, a*x=116587.0, b*y=78507.0, 总和=195094.0 [原始解] 13. 组合: a=74, b=91.5 (5 个有效解) 1. x=1118, y=1228.0, a*x=82732.0, b*y=112362.0, 总和=195094.0 [平衡解] 2. x=1301, y=1080.0, a*x=96274.0, b*y=98820.0, 总和=195094.0 [平衡解] 3. x=935, y=1376.0, a*x=69190.0, b*y=125904.0, 总和=195094.0 [原始解] 4. x=1484, y=932.0, a*x=109816.0, b*y=85278.0, 总和=195094.0 [原始解] 5. x=1667, y=784.0, a*x=123358.0, b*y=71736.0, 总和=195094.0 [原始解] 使用基础系数列表,共找到有效解 总耗时: 0.01秒