Can someone pls help with missing case for J.

Following was our approach:

• If k=0 and m=n-1 then make a tree.

• If k=0 and m=n then make a tree with a cycle of size 3

• If k=n and m>=n make a cycle using all vertices and keep on adding edges until m completed

• If n>k>=4, then keep on making triangles (cycle of size 3) connected at 1 common vertex until m>n. Once m=n then while k>0 add and connect vertices to a corner vertex of the triangles. And once k=0 then connect vertices to common vertex of the triangles.

• Else output -1

Previously, communications indicated that 350+ teams would be selected, with a limit of 5 teams per college. However, the current rules now state a total of 320 teams will be accepted, with the 5-team-per-college limit applying only to the top 25.

This sudden adjustment is a bit concerning. What feels particularly concerning is that this new, two-tiered system was never mentioned. If there was always an intention to apply a different, more restrictive limit (e.g., 4 teams) to colleges outside the top 25, that should have been specified from the start.

Agreed with the typo in Selection Criteria 2. I believe it should be 5 for Selection Criteria 2 since it was mentioned that 5 teams per college would be allowed, but it is showing 4. Let's hope that this would be rectified soon.

Nice round with nice problems!

Thank you

Thank you

Auto comment: topic has been updated by SP1029 (previous revision, new revision, compare).

Auto comment: topic has been updated by SP1029 (previous revision, new revision, compare).