29 lines
839 B
Markdown
29 lines
839 B
Markdown
|
---
|
||
|
slug: /plat/dp-bitmasks
|
||
|
title: "Dynamic Programming on Bitmasks"
|
||
|
author: Michael Cao
|
||
|
order: 10
|
||
|
prerequisites:
|
||
|
-
|
||
|
- Bit Operations
|
||
|
-
|
||
|
- Gold - Introduction to Dynamic Programming
|
||
|
---
|
||
|
|
||
|
<!-- END DESCRIPTION -->
|
||
|
|
||
|
Note: Has not appeared on recent USACO.
|
||
|
|
||
|
## Tutorial
|
||
|
|
||
|
* CPH Chapter 10
|
||
|
* [Dynamic Programming Over Subsets (Codeforces)](https://codeforces.com/blog/entry/337)
|
||
|
* [Dynamic Programming and Bit Masking (HackerEarth)](https://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/tutorial/)
|
||
|
|
||
|
## Problems
|
||
|
|
||
|
* [Old Gold - Moovie Moving](http://www.usaco.org/index.php?page=viewproblem2&cpid=515)
|
||
|
* [Matching](https://atcoder.jp/contests/dp/tasks/dp_o)
|
||
|
* [Square Subsets](https://codeforces.com/contest/895/problem/C)
|
||
|
* [Guards in the Storehouse](https://codeforces.com/problemset/problem/845/F)
|