Divisible Sum Pairs - HackerRank.

-
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 :



NOTE: If you are copying my code then its a advise to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of source code.





SOURCE CODE
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

// Complete the divisibleSumPairs function below.
static int divisibleSumPairs(int n, int k, int[] ar) {
int temp=0;
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
if((ar[i]+ar[j])%k==0)
temp++;
}
}
return temp;
}

private static final Scanner scanner = new Scanner(System.in);

public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

String[] nk = scanner.nextLine().split(" ");

int n = Integer.parseInt(nk[0]);

int k = Integer.parseInt(nk[1]);

int[] ar = new int[n];

String[] arItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (int i = 0; i < n; i++) {
int arItem = Integer.parseInt(arItems[i]);
ar[i] = arItem;
}

int result = divisibleSumPairs(n, k, ar);

bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();

bufferedWriter.close();

scanner.close();
}
}



Click here to Download



OUTPUT








If you have any question then leave a comment below I will do my best to answer that question.

Comments

Post a Comment

Popular posts from this blog

[Question 3] ISC 2017 Computer Practical Paper Solved – Caesar Cipher.

-
Image
Question 3: Caesar Cipher  is an encryption technique which is implemented as ROT13 (‘rotate by 13 places’). It is a simple letter substitution cipher that replaces a letter with the letter 13 places after it in the alphabets, with the other characters remaining unchanged. Write a program to accept a plain text of length L, where L must be greater than 3 and less than 100. Encrypt the text if valid as per the Caesar Cipher. Test your program with the sample data and some random data: Example 1 INPUT :  Hello! How are you? OUTPUT :  The cipher text is: Uryyb? Ubj ner lbh? Example 2 INPUT :  Encryption helps to secure data. OUTPUT :  The cipher text is: Rapelcgvba urycf gb frpher qngn. Example 3 INPUT :  You OUTPUT :  INVALID LENGTH SOURCE CODE    import java.io.*; import java.util.*; public class ISC2017_CaesarCipher {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         System.out.pri
Read more

Pattern of your own name.

-
Image
Pattern program of your own name. This is a pattern program, in this program you just have to enter your name and it will give you output in a particular manner. I have created this program when I was in class 10th for my Computer Application project. NOTE:  If you are copying my code then its a advise to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of source code. SOURCE CODE import java.io.*; public class Patter_of_your_Own_Name { public static void main(String args[])throws IOException { int time=1; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); do { System.out.print("\n\t\t\tPLEASE,ENTER YOUR GOOD NAME IN CAPITAL LETTER           :"); String str=br.readLine(); int flag=0;
Read more

Designing Patterns - Print 'Z'.

-
Image
SOURCE CODE import java.io.*; import java.util.*; public class Z {     public static void main(String args[])     {         Scanner sc=new Scanner (System.in);         System.out.print("Enter a odd number >=5 :");         int n=sc.nextInt();         int a=n/2+1;         System.out.println("\n");         if(n>=5&& n%2!=0 )                     {             for(int i=1;i<=n;i++)             {                 for(int j=n;j>0;j--)                 {                     if(i==1||i==n||j==i)                         System.out.print("Z ");                     else                         System.out.print("  ");                 }                 System.out.println();             }         }         else         System.out.println("Invalid Input.");     } } OUTPUT If you have any question then leave a comment below I will do my best to answer that question.
Read more