Dynamic　programming　is　one　of　the　fundamental　techniques　for　solving　optimization　problems.　In　this　paper　we　present　the　extremely　simple　algorithms　for　subset-sum　like　problems　with　the　bitset　class.　The　presented　algorithms　decrease　the　time　and　space　complexity　of　dynamic　programming　algorithms　by　exploiting　word　parallelism.　The　computational　experiments　demonstrate　that　the　achieved　results　are　not　only　of　theoretical　interest,　but　also　that　the　techniques　developed　may　actually　lead　to　considerably　faster　algorithms.　Copyright　©　2010　Binary　Information　Press.