package hackerrank;

import java.util.Scanner;

/**
 * https://www.hackerrank.com/challenges/beautiful-pairs
 */
public class BeautifulPairs {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // TODO
    }
}

@@ -145,108 +145,493 @@
    p
-ublic static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        // TODO
+rivate static int beautifulParis(int%5B%5D a, int%5B%5D b) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int n = in.nextInt();%0A        int%5B%5D a = new int%5Bn%5D;%0A        for (int i = 0; i %3C n; i++) %7B%0A            a%5Bi%5D = in.nextInt();%0A        %7D%0A        int%5B%5D b = new int%5Bn%5D;%0A        for (int i = 0; i %3C n; i++) %7B%0A            b%5Bi%5D = in.nextInt();%0A        %7D%0A        System.out.println(beautifulParis(a, b));
 %0A   

Update Beautiful Pairs