• I was up-solving the div2-143 2nd question I have built the logic and coded Question Link...
• the logic goes like this

I have counted all the segments lines through which k passes and maintained a boolean array to mark it as true so I loop through x (all the points between 1 to 50) and check whether it's visiting that boolean array if it visits all the boolean arrays marked true then there will be point x which equal to point k or else continue

193931831

the solution is missing some corner cases

Please let me know the missing case i have been submitting 6-7 times by changing some logic still fails

Thanks for the effort