Find The Subset

CodeChefOpen on judge ↗

You have been given N straight lines of the form x/a + y/b = 1, where a>0 and b>0. What is the largest subset of these N lines can you select such that no two lines in that set intersect in the first quadrant? The lines may intersect on the axes. The first quadrant is that region where any point P(x,y) has x > 0 and y > 0 . Input First line will contain T, number of testcases. Then the testca

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI