3 ms·
As a note, this kind of problem is NP complete in the number of locks because the subset sum problem can be embedded into it.
by comex 13y ago
As a note, this kind of problem is NP complete in the number of locks because the subset sum problem can be embedded into it.