fork download
copy 
  1. # ------------------- 可修改数字 -------------------
  2. dividend = 3500
  3. start = 630
  4. end = 700
  5. max_results = 10
  6. # ---------------------------------------------------
  7.  
  8. count = 0
  9. found = []
  10. pairs = set()  # 彻底去重
  11.  
  12. # 1. 优先显示整除
  13. for d in range(start, end + 1, 5):
  14.     if count >= max_results:
  15.         break
  16.     if dividend % d == 0:
  17.         print(f"{dividend} ÷ {d} = {dividend // d}")
  18.         print("---")
  19.         count += 1
  20.         found.append(d)
  21.  
  22. # 2. 再显示 最多两位小数（能除尽）
  23. for d in range(start, end + 1, 5):
  24.     if count >= max_results:
  25.         break
  26.     if d in found:
  27.         continue
  28.     if (dividend * 100) % d == 0:
  29.         res = dividend / d
  30.         print(f"{dividend} ÷ {d} = {res:.2f}".rstrip("0").rstrip("."))
  31.         print("---")
  32.         count += 1
  33.         found.append(d)
  34.  
  35. # 3. 拆分：不重复 + 允许相差50以内
  36. for d in range(start, end + 1, 5):
  37.     if count >= max_results:
  38.         break
  39.     if d in found:
  40.         continue
  41.  
  42.     for d2 in range(start, end + 1, 5):
  43.         if d == d2:
  44.             continue
  45.  
  46.         # ✅ 去重核心：小的在前，大的在后，只记录一次
  47.         key = tuple(sorted((d, d2)))
  48.         if key in pairs:
  49.             continue
  50.  
  51.         best = None
  52.         max_a = int(dividend * 100 / d)
  53.  
  54.         for a in range(1, max_a):
  55.             p1 = d * a / 100
  56.             p2 = dividend - p1
  57.             if p2 <= 0:
  58.                 continue
  59.  
  60.             if (p2 * 100) % d2 == 0:
  61.                 val1 = a / 100
  62.                 val2 = (p2 * 100) / d2 / 100
  63.  
  64.                 # ✅ 允许相差 50 以内，不需要完全平衡
  65.                 if abs(val1 - val2) <= 50:
  66.                     best = (val1, val2, int(p1), int(p2))
  67.                     break  # 找到就用，不纠结最优
  68.  
  69.         if best:
  70.             val1, val2, p1, p2 = best
  71.             print(f"{d}、{d2}")
  72.             print(f"{d}*{val1:.2f}".rstrip("0").rstrip(".") + f"={p1}")
  73.             print(f"{d2}*{val2:.2f}".rstrip("0").rstrip(".") + f"={p2}")
  74.             print("---")
  75.             pairs.add(key)
  76.             count += 1
  77.             break
Success #stdin #stdout 0.04s 9532KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
3500 ÷ 700 = 5
---
630、635
630*1.04=655
635*4.48=2844
---
635、640
635*0.16=101
640*5.31=3398
---
640、630
640*0.35=224
630*5.2=3276
---
645、635
645*0.75=483
635*4.75=3016
---
650、630
650*0.49=318
630*5.05=3181
---
655、630
655*0.14=91
630*5.41=3408
---
660、635
660*0.3=198
635*5.2=3302
---
665、630
665*0.1=66
630*5.45=3433
---
670、630
670*0.56=375
630*4.96=3124
---
https://ideone.com/FlzTec
language:
Python 3 nbc (python 3.7.3)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!