2 ms·
Fun fact, that problem is NOT NP-complete. It's a finite-sized instance of a class of NP-complete problems. It can be solved in constant time. That said... h
by klyrs 5y ago
Fun fact, that problem is NOT NP-complete. It's a finite-sized instance of a class of NP-complete problems. It can be solved in constant time.
That said... holy smokes that is an awful problem.