Thank you to everyone who participated in the onsite and the open mirror! Here are the solutions:
Solution
106414B - The String Only Contains a, b, and c
Solution
Solution
Solution
Solution
106414F - Approximate Three Sum
Solution
106414G - Longest Step-function Subsequence
Solution
Solution
Solution
Solution
Solution
Solution
Solution
Solution
![]() | ![]() | ![]() |











As a tester, the Jiangly Block Decomposition in N was really beautiful. Great stuff!
really enjoyed applying metropolis hastings algorithm and mcdiarmid's inequality to prove asymptotic bounds on N. thank you.
N was too hard, plz nerf for Rutgers Contest Fall 2026