comefrom: <doocs>2269.Find the K-Beauty of a Number_1.py
code: def divisorSubstrings( num: int, k: int) -> int:
      ans = 0
      s = str(num)
      for i in range(len(s) - k + 1):
          t = int(s[i : i + k])
          if t and num % t == 0:
              ans += 1
      return ans
masked: def sample_funcname ( var_0 : int , var_2 : int ) -> int :
      var_4 = 0
      var_6 = str ( var_0 )
      for var_10 in range ( len ( var_6 ) - var_2 + 1 ) :
          var_11 = int ( var_6 [ var_10 : var_10 + var_2 ] )
          if var_11 and var_0 % var_11 == 0 :
              var_4 += 1
      return var_4
  