Just like the orginal Complete Pack solution.

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