3524. Find X Value of Array I

class Solution {
    public long[] resultArray(int[] nums, int k) {
        int n = nums.length;
        long[] result = new long[k];
        long[] dp = new long[k];
        for (int r = 0; r < n; r++) {
            long[] newDp = new long[k];
            for (int rem = 0; rem < k; rem++) {
                if (dp[rem] > 0) {
                    int newRem = (int)((long) rem * (nums[r] % k) % k);
                    newDp[newRem] += dp[rem];
                }
            }
            newDp[nums[r] % k]++;
            for (int x = 0; x < k; x++) {
                result[x] += newDp[x];
            }
            dp = newDp;
        }
        return result;
    }
}

class Solution:
    def resultArray(self, nums, k):
        n = len(nums)

        result = [0] * k
        dp = [0] * k

        for num in nums:
            newDp = [0] * k

            for rem in range(k):
                if dp[rem] > 0:
                    newRem = (rem * (num % k)) % k
                    newDp[newRem] += dp[rem]

            newDp[num % k] += 1

            for x in range(k):
                result[x] += newDp[x]

            dp = newDp

        return result

class Solution {
public:
    vector<long long> resultArray(vector<int>& nums, int k) {
        int n = nums.size();

        vector<long long> result(k, 0);
        vector<long long> dp(k, 0);

        for (int num : nums) {
            vector<long long> newDp(k, 0);

            for (int rem = 0; rem < k; rem++) {
                if (dp[rem] > 0) {
                    int newRem = (1LL * rem * (num % k)) % k;
                    newDp[newRem] += dp[rem];
                }
            }

            newDp[num % k]++;

            for (int x = 0; x < k; x++) {
                result[x] += newDp[x];
            }

            dp = newDp;
        }

        return result;
    }
};

class Solution {
    resultArray(nums, k) {
        const result = new Array(k).fill(0);
        let dp = new Array(k).fill(0);

        for (const num of nums) {
            const newDp = new Array(k).fill(0);

            for (let rem = 0; rem < k; rem++) {
                if (dp[rem] > 0) {
                    const newRem =
                        (rem * (num % k)) % k;

                    newDp[newRem] += dp[rem];
                }
            }

            newDp[num % k]++;

            for (let x = 0; x < k; x++) {
                result[x] += newDp[x];
            }

            dp = newDp;
        }

        return result;
    }
}