comefrom: <doocs>1497.Check If Array Pairs Are Divisible by k_1.py
code: def canArrange( arr: List[int], k: int) -> bool:
      mod = [0] * k
      for v in arr:
          mod[v % k] += 1
      return all(mod[i] == mod[k - i] for i in range(1, k)) and mod[0] % 2 == 0
masked: def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> bool :
      var_6 = [ 0 ] * var_3
      for var_7 in var_0 :
          var_6 [ var_7 % var_3 ] += 1
      return all ( var_6 [ var_10 ] == var_6 [ var_3 - var_10 ] for var_10 in range ( 1 , var_3 ) ) and var_6 [ 0 ] % 2 == 0
  