View difference between Paste ID: mKE9C99m and 1pXhTvxz

 // Author : Saurav Kalsoor
-// Shifting Compartments - JAVA
+// Shifting Compartments - KOTLIN
 
 
-import java.util.*;
+import java.util.*
-
+
-public class Test {
+var sc = Scanner(System.`in`)
-
+
-	static Scanner sc = new Scanner(System.in);
+fun main() {
-	public static void main(String[] args) {
+    val n = sc.nextInt()
-		int n = sc.nextInt();
+    val q = sc.nextInt()
-		int q = sc.nextInt();
+    val str = sc.next()
     val l = ArrayList<Int>()
-		String str = sc.next();
+    val r = ArrayList<Int>()
-
+    val k = ArrayList<Int>()
-		ArrayList<Integer> l = new ArrayList<>();
+
-		ArrayList<Integer> r = new ArrayList<>();
+    for (i in 0 until q) {
-		ArrayList<Integer> k = new ArrayList<>();
+        l.add(sc.nextInt())
-
+        r.add(sc.nextInt())
-		for(int i=0; i < q ;i++){
+        k.add(sc.nextInt())
-			l.add(sc.nextInt());
+    }
-			r.add(sc.nextInt());
+    println(shiftingCompartments(n, q, str, l, r, k))
-			k.add(sc.nextInt());
+
-		}
+
-
+fun shiftingCompartments(n: Int, q: Int, s: String, l: ArrayList<Int>, r: ArrayList<Int>, k: ArrayList<Int>): String? {
-		System.out.println(shiftingCompartments(n, q, str, l, r, k));
+    val str = s.toCharArray()
-	}
+    for (i in 0 until q) {
-
+        cycle(str, l[i], r[i], k[i])
-	public static String shiftingCompartments(int n, int q, String s, ArrayList<Integer> l, ArrayList<Integer> r, ArrayList<Integer> k){
+    }
-		char[] str = s.toCharArray();
+    return String(str)
 }
-		for(int i=0; i < q; i++){
+
-			cycle(str, l.get(i), r.get(i), k.get(i));
+fun myReverse(str: CharArray, i: Int, j: Int) {
-		}
+    var i = i
     var j = j
-		return String.valueOf(str);
+    while (i < j) {
-	}
+        val temp = str[i]
         str[i] = str[j]
-	public static void myReverse(char[] str, int i, int j){
+        str[j] = temp
-		while(i < j){
+        i++
-			char temp = str[i];
+        j--
-			str[i] = str[j];
+    }
-			str[j] = temp;
+
-			i++;
+
-			j--;
+fun cycle(str: CharArray, l: Int, r: Int, k: Int) {
-		}
+    var k = k
-	}
+    val n = r - l + 1
-
+    k %= n
-	public static void cycle(char[] str, int l, int r, int k){
+    myReverse(str, l, l + n - k - 1)
-		int n = r-l+1;
+    myReverse(str, l + n - k, r)
-		k = k%n;
+    myReverse(str, l, r)
-		myReverse(str, l, l+n-k-1);
+}