title: I don't know how to solve this
body: <p>After receiving the k value from the user, find the largest value and the n value at that time without (1+2+3+…+n) exceeding k.</p>
  <p><a href="https://i.stack.imgur.com/MGXP4.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/MGXP4.png" alt="enter image description here" /></a></p>
  <p>How do I solve this?</p>
  <p>Since I am Korean, I don't speak English well, so I don't know how to ask questions, so I only wrote the main subject. sorry..</p>