View difference between Paste ID: thkqScts and JaufmpZH

 // Author : Saurav Kalsoor
-// Count Quadruplets - JAVA
+// Count Quadruplets - KOTLIN
 
-import java.util.*;
+import java.util.*
 
-public class Test {
+var sc = Scanner(System.`in`)
-    static Scanner sc = new Scanner(System.in);
+
-    public static void main(String[] args) {
+fun main() {
-        int n = sc.nextInt();
+    val n = sc.nextInt()
-        int m = sc.nextInt();
+    val m = sc.nextInt()
-        int p = sc.nextInt();
+    val p = sc.nextInt()
-        int q = sc.nextInt();
+    val q = sc.nextInt()
-        int target = sc.nextInt();
+    val target = sc.nextInt()
 
-        ArrayList<Integer> a = new ArrayList<>();
+    val a = ArrayList<Int>()
-        ArrayList<Integer> b = new ArrayList<>();
+    val b = ArrayList<Int>()
-        ArrayList<Integer> c = new ArrayList<>();
+    val c = ArrayList<Int>()
-        ArrayList<Integer> d = new ArrayList<>();
+    val d = ArrayList<Int>()
 
-		for(int i = 0;i < n; i++){
+    for (i in 0 until n) {
-			a.add(sc.nextInt());
+        a.add(sc.nextInt())
-		}
+
     for (i in 0 until m) {
-        for(int i = 0;i < m; i++){
+        b.add(sc.nextInt())
-			b.add(sc.nextInt());
+
-		}
+    for (i in 0 until p) {
         c.add(sc.nextInt())
-        for(int i = 0;i < p; i++){
+
-			c.add(sc.nextInt());
+    for (i in 0 until q) {
-		}
+        d.add(sc.nextInt())
     }
-        for(int i = 0;i < q; i++){
+    println(countQuadruplets(a, b, c, d, target))
-			d.add(sc.nextInt());
+
-		}
+
-		System.out.println(countQuadruplets(a, b, c, d, target));
+fun countQuadruplets(a: ArrayList<Int>, b: ArrayList<Int>, c: ArrayList<Int>, d: ArrayList<Int>, target: Int): Int {
     val map = HashMap<Int, Int>()
     for (i in a) {
-    public static int countQuadruplets(ArrayList<Integer> a, ArrayList<Integer> b, ArrayList<Integer> c, ArrayList<Integer> d, int target) {
+        for (j in b) {
-        HashMap<Integer, Integer> map = new HashMap<>();
+            if (map.containsKey(i + j)) {
-
+                map[i + j] = map[i + j]!! + 1
-        for (int i : a) {
+            } else map[i + j] = 1
-            for (int j : b) {
+
-                if (map.containsKey(i + j)) {
+
-                    map.put(i + j, map.get(i + j) + 1);
+    var count = 0
-                } else
+    for (i in c) {
-                    map.put(i + j, 1);
+        for (j in d) {
             if (map.containsKey(target - i - j)) {
                 count += map[target - i - j]!!
-
+
-        int count = 0;
+
-
+
-        for (int i : c) {
+    return count
-            for (int j : d) {
+
-                if (map.containsKey(target - i - j)) {
+
-                    count += map.get(target - i - j);
+
-                }
+