▲ | notemap 4 days ago | |
Don't trust it. Problem B required an algorithm to run for inputs up to N ~ 200, and a clever graph theory lemma, before succumbing to pattern matching / law of larger numbers. Claiming that there's a pattern for N < 20 seems like classic AI slop. EDIT: Just submitted it, WA. Yeah. Problems are hard enough where consumer models can't solve all 12 problems. |