---
id: dp-bitmasks
title: "Dynamic Programming on Bitmasks"
author: Michael Cao
prerequisites:
-
- Bit Operations
- Gold - Introduction to Dynamic Programming
Has not been the solution to any platinum problem, but appeared in old gold and can be used for subtasks.
## 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
- [CSES Hamiltonian Flights](https://cses.fi/problemset/task/1690)
- [CSES Elevator Rides](https://cses.fi/problemset/task/1653)
- [Old Gold - Moovie Moving](http://www.usaco.org/index.php?page=viewproblem2&cpid=515)
- [AC Matching](https://atcoder.jp/contests/dp/tasks/dp_o)
- [CF Square Subsets](https://codeforces.com/contest/895/problem/C)
- [CF Guards in the Storehouse](https://codeforces.com/problemset/problem/845/F)
- [Kattis Cat & Mice](https://open.kattis.com/problems/catandmice) [](66)
- plus a bit of geometry
