There is this one question I have been struck on for like past 16 hours thinking and thinking...

Then I have been solving it for n==2 case individually and analyzed all cases with respect to all previous results instead of writing recursion code where constraints allowed me to write. Then I found out a pattern in which I can write the pairs , which I used in my solution.

The pattern follows this way : list size is initially 0 , add pair (0,0) into it. now size is 1.

Take the smallest positive value that has not encountered yet, and make it first term in pair and add the size of list to that number (1,2) , now add this pair to list, now list has 2 pairs.

next smallest positive number that has not been encountered yet is 3, and size of list is 2, so pair is (3,5)... like this we can continue...

So my real confusion is I cannot prove this always works for higher numbers, I just bruteforced values till like 5/6 and assumed it follows this pattern. And surprisingly I have cleared constraints, can someone tell me why this pattern works...

I haven't asked this to AI because I want to know from my CP Lovers who else saw this pattern and solved this way...

Sorry if there are any mistakes because this is my first blog.