class Solution {
public:
    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
        auto sum  = 0;
        int tmp = 1,j = 0;
        for(int i=0;i<nums.size();i++)
        {
            tmp *= nums[i];
            while(j<=i && tmp>=k)
            {
                tmp /= nums[j];
                j++;
            }
            sum += i-j+1;
        }
        return sum;
    }
};