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