Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link ×

Bitmask DP

Revision en2, by john_hopes, 2015-12-05 00:08:04

In a bitmask DP problem, there 10 digits. And for every digits I need to store three types of data ( Not used, Used and Using ). One way to solve this is using two bitmask. But for some other reasons It is not possible to use two bitmask in my case. Is there any other memory efficient way to do so? Is there any good resources for learning this?

Tags bitmask, dynamic programming


  Rev. Lang. By When Δ Comment
en2 English john_hopes 2015-12-05 00:08:04 49 Tiny change: 'to do so? ' -> 'to do so? \nIs there any good resources for learning this? '
en1 English john_hopes 2015-12-05 00:07:04 310 Initial revision (published)