Backpack

n个整数a[1...n]，装m的背包

• state: 前i个数，能否组成和为j
• function: dp[i][j] = dp[i-1][j] or dp[i-1][j-a[i]]
• initialize: dp[x][0] = true; dp[0][j] = false;
• answer: