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_1 : int ) -> bool :
      var_2 = [ 0 ] * var_1
      for var_3 in var_0 :
          var_2 [ var_3 % var_1 ] += 1
      return all ( var_2 [ var_4 ] == var_2 [ var_1 - var_4 ] for var_4 in range ( 1 , var_1 ) ) and var_2 [ 0 ] % 2 == 0
  