Hacker Rank "Division Sum pairs" solution

Question :---

You are given an array of  integers, , and a positive integer, . Find and print the number of  pairs where  and  +  is divisible by .

For example,  and . Our three pairs meeting the criteria are  and .

Function Description

Complete the divisibleSumPairs function in the editor below. It should return the integer count of pairs meeting the criteria.

divisibleSumPairs has the following parameter(s):

• n: the integer length of array 
• ar: an array of integers
• k: the integer to divide the pair sum by

Input Format

The first line contains  space-separated integers,  and .
The second line contains  space-separated integers describing the values of .

Constraints

Output Format

Print the number of  pairs where  and  +  is evenly divisible by .

Sample Input

6 3
1 3 2 6 1 2

Sample Output

 5

Explanation

Here are the  valid pairs when :

Solution : -

<?php

/* Write your PHP code here */

$ar = array(1,3,2,6,1,2);

$k = 3;

$n = 6;

$count = 0;

$sum = 0;

for($i=0;$i<$n-1;$i++){

for($j=$i+1;$j<$n;$j++){

$sum = $ar[$i] + $ar[$j];

if($sum % $k == 0){

$count++;

}

}

}

echo $count;

?>