HackerRank Divisible Sum Pairs Problem Solution

#include <stdio.h>
#include <stdlib.h>

int main()
{   int n,k,i,j;
    int c=0;
    
     scanf("%d%d",&n,&k);
     int arr[n];
    for(i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);

    }


    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(((arr[i]+arr[j])%k)==0)
                c=c+1;
        }
    }
    printf("%d",c);
    return 0;
}

HackerRank Divisible Sum Pairs Problem Solution in JavaScript

process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;
});

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});

function readLine() {
    return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function main() {
    var n_temp = readLine().split(' ');
    var n = parseInt(n_temp[0]);
    var k = parseInt(n_temp[1]);
    a = readLine().split(' ');
    a = a.map(Number);
    var totalPair = 0;
    for(var i = 0; i < n - 1; i++) {
        for(var j = i + 1; j < n; j++) {
            
            if( i !== j && i < j ) {
                if((a[i] + a[j]) % k === 0) {
                    totalPair++;
                }
            }
            
        }
    }
    
    console.log(totalPair);

}

HackerRank Divisible Sum Pairs Problem Solution in Python

#!/bin/python3

import sys


n,k = input().strip().split(' ')
n,k = [int(n),int(k)]
a = [int(a_temp) for a_temp in input().strip().split(' ')]
t = 0
for i in range(n):
    c = a[i]
    for d in a[i+1:]:
        t += [0, 1][(c+d)%k == 0]
        
print(t)