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_1 : int ) -> int :
      var_2 = 0
      var_3 = str ( var_0 )
      for var_4 in range ( len ( var_3 ) - var_1 + 1 ) :
          var_5 = int ( var_3 [ var_4 : var_4 + var_1 ] )
          if var_5 and var_0 % var_5 == 0 :
              var_2 += 1
      return var_2
  