comefrom: <doocs>2393.Count Strictly Increasing Subarrays_1.py
code: def countSubarrays( nums: List[int]) -> int:
      ans = i = 0
      while i < len(nums):
          j = i + 1
          while j < len(nums) and nums[j] > nums[j - 1]:
              j += 1
          cnt = j - i
          ans += (1 + cnt) * cnt // 2
          i = j
      return ans
masked: def sample_funcname ( var_0 : List [ int ] ) -> int :
      var_5 = var_3 = 0
      while var_3 < len ( var_0 ) :
          var_8 = var_3 + 1
          while var_8 < len ( var_0 ) and var_0 [ var_8 ] > var_0 [ var_8 - 1 ] :
              var_8 += 1
          var_9 = var_8 - var_3
          var_5 += ( 1 + var_9 ) * var_9 // 2
          var_3 = var_8
      return var_5
  