The Weekly Challenge - 262-2

TASK #2: Count Equal Divisible
You are given an array of integers, @ints and an integer $k. Write a script to return the number of pairs (i, j) where

a) 0 <= i < j < size of @ints
b) ints[i] == ints[j]
c) i x j is divisible by k

Here my solution, without keyword 'my', without validating '@ints' and $k, without a module:

sub count_equal_divisible {
  ($aref, $k) = @_;	
  @array = @{$aref};
  $success = 0;

  for ($i = 0; $i < scalar(@array)-1; $i++) {
    for ($j = $i + 1; $j < scalar(@array); $j++) {
        $success++ if ( $array[$i] == $array[$j] && (($i * $j) % $k == 0) );
    }
  }
  print("The number of equal divisible pairs (i, j): ", $success, "\n");
}

@ints = qw(3 1 2 2 2 1 3); 
$k = 2;
count_equal_divisible(\@ints, $k); # 4

@ints = qw(1 2 3);
$k = 1;
count_equal_divisible(\@ints, $k); # 0