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_2 = var_1 = 0
      while var_1 < len ( var_0 ) :
          var_3 = var_1 + 1
          while var_3 < len ( var_0 ) and var_0 [ var_3 ] > var_0 [ var_3 - 1 ] :
              var_3 += 1
          var_4 = var_3 - var_1
          var_2 += ( 1 + var_4 ) * var_4 // 2
          var_1 = var_3
      return var_2
  