fork download
  1. from itertools import product, combinations_with_replacement
  2. import time
  3. import threading
  4. from collections import defaultdict
  5. import math
  6.  
  7. # 配置参数(可根据需要修改)
  8. TARGET = 14418 # 目标值
  9. BASE_VALUES = [35, 40.5, 58, 67, 73, 90.5] # 基础系数列表
  10. FLUCTUATION = 1.0 # 系数波动范围
  11. MAX_SOLUTIONS = 3 # 每个组合的最大解数量
  12. SOLVER_TIMEOUT = 180 # 求解超时时间(秒)
  13. THREE_VAR_THRESHOLD = 220000 # 使用三个变量的阈值
  14. PRODUCT_RANGE_THRESHOLD = 148000 # 乘积范围限制阈值
  15. HIGH_TARGET_THRESHOLD = 260000 # 更高目标值阈值
  16. SHOW_PROGRESS = True # 是否显示进度
  17. MAX_SOLUTIONS_PER_COMB = 100 # 每个组合的最大解数量,用于提前终止
  18.  
  19. def is_valid_product(p):
  20. """检查单个乘积是否在有效范围内"""
  21. if TARGET > PRODUCT_RANGE_THRESHOLD:
  22. if TARGET > HIGH_TARGET_THRESHOLD:
  23. return p <= 115000 # 目标值超过260000时,仅限制最大值
  24. else:
  25. return 74000 <= p <= 115000 # 目标值在148000-260000之间时,使用原范围
  26. else:
  27. return True # 目标值较小时不限制乘积范围
  28.  
  29. def find_single_variable_solutions(values):
  30. """查找单个数的解(a*x = TARGET)"""
  31. solutions = []
  32. for a in values:
  33. x = TARGET / a
  34. if x.is_integer() and 1 <= x <= 10000 and is_valid_product(a * x):
  35. solutions.append((a, x))
  36. if len(solutions) >= MAX_SOLUTIONS:
  37. return solutions # 提前终止
  38. return solutions
  39.  
  40. def find_two_variable_solutions(values):
  41. """查找两个变量的解(a*x + b*y = TARGET)"""
  42. solutions = defaultdict(list)
  43.  
  44. # 生成所有可能的(a, b)组合
  45. for a in values:
  46. for b in values:
  47. if a == b: # 避免重复
  48. continue
  49.  
  50. # 计算x的有效范围
  51. min_x = max(1, math.ceil((TARGET - b * 10000) / a))
  52. max_x = min(math.floor((TARGET - 1) / a), 10000)
  53.  
  54. if max_x < min_x:
  55. continue
  56.  
  57. for x in range(min_x, max_x + 1):
  58. remainder = TARGET - a * x
  59.  
  60. # 检查remainder是否在可能的范围内
  61. if remainder < 1 or remainder > b * 10000:
  62. continue
  63.  
  64. # 检查remainder是否能被b整除
  65. if remainder % b == 0:
  66. y = remainder // b
  67. if 1 <= y <= 10000 and is_valid_product(b * y):
  68. solutions[(a, b)].append((a, x, b, y))
  69. if len(solutions[(a, b)]) >= MAX_SOLUTIONS_PER_COMB:
  70. break # 提前终止当前组合的搜索
  71.  
  72. return solutions
  73.  
  74. def find_three_variable_solutions(values):
  75. """优化的三变量求解算法"""
  76. solutions = defaultdict(list)
  77.  
  78. # 对系数进行排序,便于剪枝
  79. sorted_values = sorted(values)
  80.  
  81. # 预计算每个系数的有效范围
  82. value_ranges = {}
  83. for a in sorted_values:
  84. if TARGET > PRODUCT_RANGE_THRESHOLD:
  85. if TARGET > HIGH_TARGET_THRESHOLD:
  86. min_x = max(1, math.ceil(1 / a)) # 取消下限,最小为1
  87. max_x = min(10000, math.floor(115000 / a))
  88. else:
  89. min_x = max(1, math.ceil(74000 / a))
  90. max_x = min(10000, math.floor(115000 / a))
  91. else:
  92. min_x = 1
  93. max_x = 10000
  94. value_ranges[a] = (min_x, max_x)
  95.  
  96. total_combinations = len(sorted_values) * (len(sorted_values) - 1) * (len(sorted_values) - 2) // 6
  97. processed_combinations = 0
  98.  
  99. # 三重循环,但添加了更多剪枝条件
  100. for i, a in enumerate(sorted_values):
  101. min_x, max_x = value_ranges[a]
  102.  
  103. # 计算可能的x值数量,决定步长
  104. x_count = max_x - min_x + 1
  105. x_step = max(1, x_count // 1000) # 自适应步长
  106.  
  107. for x in range(min_x, max_x + 1, x_step):
  108. ax = a * x
  109. if not is_valid_product(ax):
  110. continue
  111.  
  112. remainder1 = TARGET - ax
  113. if TARGET > PRODUCT_RANGE_THRESHOLD:
  114. if TARGET > HIGH_TARGET_THRESHOLD:
  115. if remainder1 < 0:
  116. continue
  117. else:
  118. if remainder1 < 2 * 74000:
  119. continue
  120.  
  121. # 限制b的选择范围,避免重复组合
  122. for j in range(i + 1, len(sorted_values)):
  123. b = sorted_values[j]
  124.  
  125. if TARGET > PRODUCT_RANGE_THRESHOLD:
  126. if TARGET > HIGH_TARGET_THRESHOLD:
  127. min_y = max(1, math.ceil(1 / b)) # 取消下限,最小为1
  128. max_y = min(10000, math.floor(remainder1 / b))
  129. else:
  130. min_y = max(1, math.ceil(74000 / b))
  131. max_y = min(10000, math.floor((remainder1 - 74000) / b))
  132. else:
  133. min_y = 1
  134. max_y = math.floor(remainder1 / b)
  135.  
  136. if max_y < min_y:
  137. continue
  138.  
  139. # 计算可能的y值数量,决定步长
  140. y_count = max_y - min_y + 1
  141. y_step = max(1, y_count // 100) # 自适应步长
  142.  
  143. for y in range(min_y, max_y + 1, y_step):
  144. by = b * y
  145. if not is_valid_product(by):
  146. continue
  147.  
  148. remainder2 = remainder1 - by
  149. if TARGET > PRODUCT_RANGE_THRESHOLD:
  150. if TARGET > HIGH_TARGET_THRESHOLD:
  151. if remainder2 < 0 or remainder2 > 115000:
  152. continue
  153. else:
  154. if remainder2 < 74000 or remainder2 > 115000:
  155. continue
  156.  
  157. # 限制c的选择范围
  158. found_solution = False
  159. for k in range(j + 1, len(sorted_values)):
  160. c = sorted_values[k]
  161.  
  162. # 检查remainder2是否能被c整除
  163. if remainder2 % c != 0:
  164. continue
  165.  
  166. z = remainder2 // c
  167. if 1 <= z <= 10000 and is_valid_product(c * z):
  168. key = (a, b, c)
  169. solutions[key].append((a, x, b, y, c, z))
  170. found_solution = True
  171. if len(solutions[key]) >= MAX_SOLUTIONS_PER_COMB:
  172. break # 提前终止当前组合的搜索
  173.  
  174. # 如果找到解且达到最大数量,跳出y循环
  175. if found_solution and len(solutions[key]) >= MAX_SOLUTIONS_PER_COMB:
  176. break # 跳出y循环
  177.  
  178. # 进度显示
  179. if SHOW_PROGRESS and j % 10 == 0:
  180. print(f"\r三变量组合进度: {processed_combinations}/{total_combinations} 组", end='')
  181. processed_combinations += 1
  182.  
  183. if SHOW_PROGRESS:
  184. print(f"\r三变量组合进度: {processed_combinations}/{total_combinations} 组 - 完成")
  185.  
  186. return solutions
  187.  
  188. def find_balanced_solutions(solutions, var_count, num=2):
  189. """从所有解中筛选出最平衡的解"""
  190. if var_count == 1 or not solutions:
  191. return solutions # 单变量或无解时直接返回
  192.  
  193. # 当目标值超过220000时,不计算平衡解
  194. if TARGET > THREE_VAR_THRESHOLD:
  195. return []
  196.  
  197. # 计算解的平衡性(变量间差异最小)
  198. balanced = []
  199. for sol in solutions:
  200. vars = sol[1::2] # 提取x, y, z
  201. diff = max(vars) - min(vars)
  202. balanced.append((diff, sol))
  203.  
  204. # 按差异排序,取前num个
  205. return [s for _, s in sorted(balanced, key=lambda x: x[0])[:num]]
  206.  
  207. def find_original_solutions(solutions, balanced_solutions, num=3):
  208. """从剩余解中获取原始顺序的解"""
  209. if not solutions:
  210. return []
  211.  
  212. # 排除已在平衡解中的项
  213. remaining = [s for s in solutions if s not in balanced_solutions]
  214. return remaining[:num]
  215.  
  216. def display_solutions(solutions_dict, var_count):
  217. """优化的解显示函数"""
  218. if not solutions_dict:
  219. return
  220.  
  221. print(f"\n找到 {len(solutions_dict)} 组{var_count}变量解:")
  222.  
  223. for i, (coeffs, pair_solutions) in enumerate(sorted(solutions_dict.items()), 1):
  224. # 当目标值超过220000时,不显示平衡解
  225. if TARGET > THREE_VAR_THRESHOLD:
  226. all_display = pair_solutions[:MAX_SOLUTIONS]
  227. print_tag = "[原始解]"
  228. else:
  229. # 计算平衡解和原始解
  230. balanced = find_balanced_solutions(pair_solutions, var_count)
  231. original = find_original_solutions(pair_solutions, balanced)
  232. all_display = balanced + original
  233.  
  234. if var_count == 1:
  235. a = coeffs
  236. print(f"\n{i}. 组合: a={a} ({len(pair_solutions)} 个有效解)")
  237. elif var_count == 2:
  238. a, b = coeffs
  239. print(f"\n{i}. 组合: a={a}, b={b} ({len(pair_solutions)} 个有效解)")
  240. else: # var_count == 3
  241. a, b, c = coeffs
  242. print(f"\n{i}. 组合: a={a}, b={b}, c={c} ({len(pair_solutions)} 个有效解)")
  243.  
  244. for j, sol in enumerate(all_display, 1):
  245. if TARGET > THREE_VAR_THRESHOLD:
  246. tag = print_tag
  247. else:
  248. tag = "[平衡解]" if j <= len(balanced) else "[原始解]"
  249.  
  250. if var_count == 1:
  251. a, x = sol
  252. print(f" {j}. x={x}, a*x={a*x:.1f}, 总和={a*x:.1f} {tag}")
  253. elif var_count == 2:
  254. a, x, b, y = sol
  255. print(f" {j}. x={x}, y={y}, a*x={a*x:.1f}, b*y={b*y:.1f}, 总和={a*x + b*y:.1f} {tag}")
  256. else: # var_count == 3
  257. a, x, b, y, c, z = sol
  258. print(f" {j}. x={x}, y={y}, z={z}, "
  259. f"a*x={a*x:.1f}, b*y={b*y:.1f}, c*z={c*z:.1f}, "
  260. f"总和={a*x + b*y + c*z:.1f} {tag}")
  261.  
  262. def run_with_timeout(func, args=(), kwargs=None, timeout=SOLVER_TIMEOUT):
  263. """运行函数并设置超时限制"""
  264. if kwargs is None:
  265. kwargs = {}
  266.  
  267. result = []
  268. error = []
  269.  
  270. def wrapper():
  271. try:
  272. result.append(func(*args, **kwargs))
  273. except Exception as e:
  274. error.append(e)
  275.  
  276. thread = threading.Thread(target=wrapper)
  277. thread.daemon = True
  278. thread.start()
  279. thread.join(timeout)
  280.  
  281. if thread.is_alive():
  282. print(f"警告: {func.__name__} 超时({timeout}秒),跳过此方法")
  283. return None
  284.  
  285. if error:
  286. raise error[0]
  287.  
  288. return result[0]
  289.  
  290. def main():
  291. print(f"目标值: {TARGET}")
  292.  
  293. # 生成波动后的系数
  294. FLUCTUATED_VALUES = [round(v - FLUCTUATION, 1) for v in BASE_VALUES]
  295.  
  296. # 尝试基础系数
  297. print(f"\n==== 尝试基础系数 ====")
  298.  
  299. # 检查目标值是否超过阈值
  300. if TARGET > THREE_VAR_THRESHOLD:
  301. print(f"目标值 {TARGET} 超过阈值 {THREE_VAR_THRESHOLD},只尝试三变量解")
  302. base_solutions = {
  303. 'single': [],
  304. 'two': [],
  305. 'three': run_with_timeout(find_three_variable_solutions, args=(BASE_VALUES,))
  306. }
  307.  
  308. # 显示三变量解
  309. if base_solutions['three'] and len(base_solutions['three']) > 0:
  310. display_solutions(base_solutions['three'], 3)
  311. print(f"\n使用基础系数列表,共找到有效解")
  312. return
  313. else:
  314. print("\n基础系数三变量无解,尝试波动系数")
  315. else:
  316. # 目标值未超过阈值,按顺序尝试单、双、三变量解
  317. base_solutions = {
  318. 'single': run_with_timeout(find_single_variable_solutions, args=(BASE_VALUES,)),
  319. 'two': run_with_timeout(find_two_variable_solutions, args=(BASE_VALUES,)),
  320. 'three': []
  321. }
  322.  
  323. # 检查是否有解
  324. has_solution = False
  325.  
  326. # 显示单变量解
  327. if base_solutions['single']:
  328. has_solution = True
  329. display_solutions({a: [sol] for a, sol in zip(BASE_VALUES, base_solutions['single']) if sol}, 1)
  330.  
  331. # 显示双变量解
  332. if base_solutions['two'] and len(base_solutions['two']) > 0:
  333. has_solution = True
  334. display_solutions(base_solutions['two'], 2)
  335.  
  336. # 单变量和双变量都无解时,尝试三变量解
  337. if not has_solution:
  338. print(f"\n==== 单变量和双变量无解,尝试三变量解 ====")
  339. base_solutions['three'] = run_with_timeout(find_three_variable_solutions, args=(BASE_VALUES,))
  340.  
  341. if base_solutions['three'] and len(base_solutions['three']) > 0:
  342. has_solution = True
  343. display_solutions(base_solutions['three'], 3)
  344.  
  345. # 如果找到解,退出程序
  346. if has_solution:
  347. print(f"\n使用基础系数列表,共找到有效解")
  348. return
  349.  
  350. # 如果基础系数没有找到解,尝试波动系数
  351. print(f"\n==== 尝试波动系数 ====")
  352.  
  353. # 检查目标值是否超过阈值
  354. if TARGET > THREE_VAR_THRESHOLD:
  355. print(f"目标值 {TARGET} 超过阈值 {THREE_VAR_THRESHOLD},只尝试三变量解")
  356. fluctuated_solutions = {
  357. 'single': [],
  358. 'two': [],
  359. 'three': run_with_timeout(find_three_variable_solutions, args=(FLUCTUATED_VALUES,))
  360. }
  361.  
  362. # 显示三变量解
  363. if fluctuated_solutions['three'] and len(fluctuated_solutions['three']) > 0:
  364. display_solutions(fluctuated_solutions['three'], 3)
  365. print(f"\n使用波动系数列表,共找到有效解")
  366. return
  367. else:
  368. # 目标值未超过阈值,按顺序尝试单、双、三变量解
  369. fluctuated_solutions = {
  370. 'single': run_with_timeout(find_single_variable_solutions, args=(FLUCTUATED_VALUES,)),
  371. 'two': run_with_timeout(find_two_variable_solutions, args=(FLUCTUATED_VALUES,)),
  372. 'three': []
  373. }
  374.  
  375. # 重置标志
  376. has_solution = False
  377.  
  378. # 显示单变量解
  379. if fluctuated_solutions['single']:
  380. has_solution = True
  381. display_solutions({a: [sol] for a, sol in zip(FLUCTUATED_VALUES, fluctuated_solutions['single']) if sol}, 1)
  382.  
  383. # 显示双变量解
  384. if fluctuated_solutions['two'] and len(fluctuated_solutions['two']) > 0:
  385. has_solution = True
  386. display_solutions(fluctuated_solutions['two'], 2)
  387.  
  388. # 单变量和双变量都无解时,尝试三变量解
  389. if not has_solution:
  390. print(f"\n==== 单变量和双变量无解,尝试三变量解 ====")
  391. fluctuated_solutions['three'] = run_with_timeout(find_three_variable_solutions, args=(FLUCTUATED_VALUES,))
  392.  
  393. if fluctuated_solutions['three'] and len(fluctuated_solutions['three']) > 0:
  394. has_solution = True
  395. display_solutions(fluctuated_solutions['three'], 3)
  396.  
  397. # 如果找到解,退出程序
  398. if has_solution:
  399. print(f"\n使用波动系数列表,共找到有效解")
  400. return
  401.  
  402. # 如果所有系数集都没有找到解
  403. print("\n没有找到符合条件的解,即使使用波动后的系数列表。")
  404.  
  405. if __name__ == "__main__":
  406. start_time = time.time()
  407. main()
  408. print(f"\n总耗时: {time.time() - start_time:.2f}秒")
Success #stdin #stdout 0.05s 10728KB
stdin
Standard input is empty
stdout
目标值: 14418

==== 尝试基础系数 ====

找到 1 组1变量解:

1. 组合: a=35 (1 个有效解)
  1. x=356.0, a*x=14418.0, 总和=14418.0 [平衡解]

找到 30 组2变量解:

1. 组合: a=35, b=40.5 (5 个有效解)
  1. x=162, y=216.0, a*x=5670.0, b*y=8748.0, 总和=14418.0 [平衡解]
  2. x=243, y=146.0, a*x=8505.0, b*y=5913.0, 总和=14418.0 [平衡解]
  3. x=81, y=286.0, a*x=2835.0, b*y=11583.0, 总和=14418.0 [原始解]
  4. x=324, y=76.0, a*x=11340.0, b*y=3078.0, 总和=14418.0 [原始解]
  5. x=405, y=6.0, a*x=14175.0, b*y=243.0, 总和=14418.0 [原始解]

2. 组合: a=35, b=58 (7 个有效解)
  1. x=170, y=146, a*x=5950.0, b*y=8468.0, 总和=14418.0 [平衡解]
  2. x=112, y=181, a*x=3920.0, b*y=10498.0, 总和=14418.0 [平衡解]
  3. x=54, y=216, a*x=1890.0, b*y=12528.0, 总和=14418.0 [原始解]
  4. x=228, y=111, a*x=7980.0, b*y=6438.0, 总和=14418.0 [原始解]
  5. x=286, y=76, a*x=10010.0, b*y=4408.0, 总和=14418.0 [原始解]

3. 组合: a=35, b=67 (6 个有效解)
  1. x=165, y=129, a*x=5775.0, b*y=8643.0, 总和=14418.0 [平衡解]
  2. x=98, y=164, a*x=3430.0, b*y=10988.0, 总和=14418.0 [平衡解]
  3. x=31, y=199, a*x=1085.0, b*y=13333.0, 总和=14418.0 [原始解]
  4. x=232, y=94, a*x=8120.0, b*y=6298.0, 总和=14418.0 [原始解]
  5. x=299, y=59, a*x=10465.0, b*y=3953.0, 总和=14418.0 [原始解]

4. 组合: a=35, b=73 (6 个有效解)
  1. x=97, y=151, a*x=3395.0, b*y=11023.0, 总和=14418.0 [平衡解]
  2. x=170, y=116, a*x=5950.0, b*y=8468.0, 总和=14418.0 [平衡解]
  3. x=24, y=186, a*x=840.0, b*y=13578.0, 总和=14418.0 [原始解]
  4. x=243, y=81, a*x=8505.0, b*y=5913.0, 总和=14418.0 [原始解]
  5. x=316, y=46, a*x=11060.0, b*y=3358.0, 总和=14418.0 [原始解]

5. 组合: a=35, b=90.5 (2 个有效解)
  1. x=112, y=116.0, a*x=3920.0, b*y=10498.0, 总和=14418.0 [平衡解]
  2. x=293, y=46.0, a*x=10255.0, b*y=4163.0, 总和=14418.0 [平衡解]

6. 组合: a=40.5, b=35 (5 个有效解)
  1. x=216, y=162.0, a*x=8748.0, b*y=5670.0, 总和=14418.0 [平衡解]
  2. x=146, y=243.0, a*x=5913.0, b*y=8505.0, 总和=14418.0 [平衡解]
  3. x=6, y=405.0, a*x=243.0, b*y=14175.0, 总和=14418.0 [原始解]
  4. x=76, y=324.0, a*x=3078.0, b*y=11340.0, 总和=14418.0 [原始解]
  5. x=286, y=81.0, a*x=11583.0, b*y=2835.0, 总和=14418.0 [原始解]

7. 组合: a=40.5, b=58 (3 个有效解)
  1. x=124, y=162.0, a*x=5022.0, b*y=9396.0, 总和=14418.0 [平衡解]
  2. x=240, y=81.0, a*x=9720.0, b*y=4698.0, 总和=14418.0 [平衡解]
  3. x=8, y=243.0, a*x=324.0, b*y=14094.0, 总和=14418.0 [原始解]

8. 组合: a=40.5, b=67 (2 个有效解)
  1. x=88, y=162.0, a*x=3564.0, b*y=10854.0, 总和=14418.0 [平衡解]
  2. x=222, y=81.0, a*x=8991.0, b*y=5427.0, 总和=14418.0 [平衡解]

9. 组合: a=40.5, b=73 (2 个有效解)
  1. x=64, y=162.0, a*x=2592.0, b*y=11826.0, 总和=14418.0 [平衡解]
  2. x=210, y=81.0, a*x=8505.0, b*y=5913.0, 总和=14418.0 [平衡解]

10. 组合: a=40.5, b=90.5 (1 个有效解)
  1. x=175, y=81.0, a*x=7087.5, b*y=7330.5, 总和=14418.0 [平衡解]

11. 组合: a=58, b=35 (7 个有效解)
  1. x=146, y=170, a*x=8468.0, b*y=5950.0, 总和=14418.0 [平衡解]
  2. x=181, y=112, a*x=10498.0, b*y=3920.0, 总和=14418.0 [平衡解]
  3. x=6, y=402, a*x=348.0, b*y=14070.0, 总和=14418.0 [原始解]
  4. x=41, y=344, a*x=2378.0, b*y=12040.0, 总和=14418.0 [原始解]
  5. x=76, y=286, a*x=4408.0, b*y=10010.0, 总和=14418.0 [原始解]

12. 组合: a=58, b=40.5 (3 个有效解)
  1. x=162, y=124.0, a*x=9396.0, b*y=5022.0, 总和=14418.0 [平衡解]
  2. x=81, y=240.0, a*x=4698.0, b*y=9720.0, 总和=14418.0 [平衡解]
  3. x=243, y=8.0, a*x=14094.0, b*y=324.0, 总和=14418.0 [原始解]

13. 组合: a=58, b=67 (4 个有效解)
  1. x=140, y=94, a*x=8120.0, b*y=6298.0, 总和=14418.0 [平衡解]
  2. x=73, y=152, a*x=4234.0, b*y=10184.0, 总和=14418.0 [平衡解]
  3. x=6, y=210, a*x=348.0, b*y=14070.0, 总和=14418.0 [原始解]
  4. x=207, y=36, a*x=12006.0, b*y=2412.0, 总和=14418.0 [原始解]

14. 组合: a=58, b=73 (4 个有效解)
  1. x=90, y=126, a*x=5220.0, b*y=9198.0, 总和=14418.0 [平衡解]
  2. x=163, y=68, a*x=9454.0, b*y=4964.0, 总和=14418.0 [平衡解]
  3. x=17, y=184, a*x=986.0, b*y=13432.0, 总和=14418.0 [原始解]
  4. x=236, y=10, a*x=13688.0, b*y=730.0, 总和=14418.0 [原始解]

15. 组合: a=58, b=90.5 (1 个有效解)
  1. x=130, y=76.0, a*x=7540.0, b*y=6878.0, 总和=14418.0 [平衡解]

16. 组合: a=67, b=35 (6 个有效解)
  1. x=129, y=165, a*x=8643.0, b*y=5775.0, 总和=14418.0 [平衡解]
  2. x=164, y=98, a*x=10988.0, b*y=3430.0, 总和=14418.0 [平衡解]
  3. x=24, y=366, a*x=1608.0, b*y=12810.0, 总和=14418.0 [原始解]
  4. x=59, y=299, a*x=3953.0, b*y=10465.0, 总和=14418.0 [原始解]
  5. x=94, y=232, a*x=6298.0, b*y=8120.0, 总和=14418.0 [原始解]

17. 组合: a=67, b=40.5 (2 个有效解)
  1. x=162, y=88.0, a*x=10854.0, b*y=3564.0, 总和=14418.0 [平衡解]
  2. x=81, y=222.0, a*x=5427.0, b*y=8991.0, 总和=14418.0 [平衡解]

18. 组合: a=67, b=58 (4 个有效解)
  1. x=94, y=140, a*x=6298.0, b*y=8120.0, 总和=14418.0 [平衡解]
  2. x=152, y=73, a*x=10184.0, b*y=4234.0, 总和=14418.0 [平衡解]
  3. x=36, y=207, a*x=2412.0, b*y=12006.0, 总和=14418.0 [原始解]
  4. x=210, y=6, a*x=14070.0, b*y=348.0, 总和=14418.0 [原始解]

19. 组合: a=67, b=73 (3 个有效解)
  1. x=79, y=125, a*x=5293.0, b*y=9125.0, 总和=14418.0 [平衡解]
  2. x=152, y=58, a*x=10184.0, b*y=4234.0, 总和=14418.0 [平衡解]
  3. x=6, y=192, a*x=402.0, b*y=14016.0, 总和=14418.0 [原始解]

20. 组合: a=67, b=90.5 (1 个有效解)
  1. x=45, y=126.0, a*x=3015.0, b*y=11403.0, 总和=14418.0 [平衡解]

21. 组合: a=73, b=35 (6 个有效解)
  1. x=116, y=170, a*x=8468.0, b*y=5950.0, 总和=14418.0 [平衡解]
  2. x=151, y=97, a*x=11023.0, b*y=3395.0, 总和=14418.0 [平衡解]
  3. x=11, y=389, a*x=803.0, b*y=13615.0, 总和=14418.0 [原始解]
  4. x=46, y=316, a*x=3358.0, b*y=11060.0, 总和=14418.0 [原始解]
  5. x=81, y=243, a*x=5913.0, b*y=8505.0, 总和=14418.0 [原始解]

22. 组合: a=73, b=40.5 (2 个有效解)
  1. x=162, y=64.0, a*x=11826.0, b*y=2592.0, 总和=14418.0 [平衡解]
  2. x=81, y=210.0, a*x=5913.0, b*y=8505.0, 总和=14418.0 [平衡解]

23. 组合: a=73, b=58 (4 个有效解)
  1. x=126, y=90, a*x=9198.0, b*y=5220.0, 总和=14418.0 [平衡解]
  2. x=68, y=163, a*x=4964.0, b*y=9454.0, 总和=14418.0 [平衡解]
  3. x=10, y=236, a*x=730.0, b*y=13688.0, 总和=14418.0 [原始解]
  4. x=184, y=17, a*x=13432.0, b*y=986.0, 总和=14418.0 [原始解]

24. 组合: a=73, b=67 (3 个有效解)
  1. x=125, y=79, a*x=9125.0, b*y=5293.0, 总和=14418.0 [平衡解]
  2. x=58, y=152, a*x=4234.0, b*y=10184.0, 总和=14418.0 [平衡解]
  3. x=192, y=6, a*x=14016.0, b*y=402.0, 总和=14418.0 [原始解]

25. 组合: a=73, b=90.5 (1 个有效解)
  1. x=138, y=48.0, a*x=10074.0, b*y=4344.0, 总和=14418.0 [平衡解]

26. 组合: a=90.5, b=35 (2 个有效解)
  1. x=116, y=112.0, a*x=10498.0, b*y=3920.0, 总和=14418.0 [平衡解]
  2. x=46, y=293.0, a*x=4163.0, b*y=10255.0, 总和=14418.0 [平衡解]

27. 组合: a=90.5, b=40.5 (1 个有效解)
  1. x=81, y=175.0, a*x=7330.5, b*y=7087.5, 总和=14418.0 [平衡解]

28. 组合: a=90.5, b=58 (1 个有效解)
  1. x=76, y=130.0, a*x=6878.0, b*y=7540.0, 总和=14418.0 [平衡解]

29. 组合: a=90.5, b=67 (1 个有效解)
  1. x=126, y=45.0, a*x=11403.0, b*y=3015.0, 总和=14418.0 [平衡解]

30. 组合: a=90.5, b=73 (1 个有效解)
  1. x=48, y=138.0, a*x=4344.0, b*y=10074.0, 总和=14418.0 [平衡解]

使用基础系数列表,共找到有效解

总耗时: 0.00秒