Djsg

Revision ru1, by alexRiot, 2026-02-28 19:07:08

n, k = map(int, input().split()) lo, hi = 1, n ans = n while lo <= hi: mid = (lo + hi) // 2 q = n // mid r = n % mid total = r * (q + 1) * (q + 2) // 2 + (mid — r) * q * (q + 1) // 2 if total <= k: ans = mid hi = mid — 1 else: lo = mid + 1 print(ans)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
ru1 Russian alexRiot 2026-02-28 19:07:08 329 Первая редакция (опубликовано)