# LeetCode - 0377. Combination Sum IV
### 題目網址：https://leetcode.com/problems/combination-sum-iv/
###### tags: `LeetCode` `Medium` `動態規劃（Dynamic Programming）`

/*
    -LeetCode format-
    Problem: 377. Combination Sum IV
    Difficulty: Medium
    
    by Inversionpeter
*/



unsigned DP[1001] = { 1 };

static const auto Initialize = []{
    ios::sync_with_stdio(false); cout.tie(nullptr);
    return nullptr;
}();

class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        for (int i = 1; i <= target; ++i) {
            DP[i] = 0;
            for (int j = 0; j < nums.size(); ++j)
                if (nums[j] <= i)
                    DP[i] += DP[i - nums[j]];
        }
        return DP[target];
    }
};