2470_NumberofSubarraysWithLCMEqualtoK - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int subarrayLCM(vector<int>& nums, int k) {
        unsigned int n= nums.size(), ret = 0;
        for(int i=0;i<n;++i)
        {
            unsigned int t = nums[i];
            for(int j=i;j<n;j++)
            {
                t= lcm(t, nums[j]);
                if(t==k) ret++;
            }
        }
        
        return ret;
    }
};