Updating dev-sh branch

Divisions/Beta/Round15/MaximumIncrease.java

@@ -0,0 +1,31 @@
+package Divisions.Beta.Round15;
+
+//code by senurah
+import java.util.Scanner;
+
+public class MaximumIncrease {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int n = scanner.nextInt();
+        int[] arr = new int[n];
+
+        for (int i = 0; i < n; i++) {
+            arr[i] = scanner.nextInt();
+        }
+
+        int maxLength = 1;
+        int currentLength = 1;
+
+        for (int i = 1; i < n; i++) {
+            if (arr[i] > arr[i - 1]) {
+                currentLength++;
+                maxLength = Math.max(maxLength, currentLength);
+            } else {
+                currentLength = 1;
+            }
+        }
+
+        System.out.println(maxLength);
+        scanner.close();
+    }
+}

Divisions/Beta/Round32/Borze.java

@@ -0,0 +1,23 @@
+package Divisions.Beta.Round32;
+//code by senurah
+public class Borze {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        String s = scanner.next();
+
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < s.length(); i++) {
+            if (s.charAt(i) == '.') {
+                sb.append("0");
+            } else if (s.charAt(i) == '-' && s.charAt(i + 1) == '.') {
+                sb.append("1");
+                i++;
+            } else if (s.charAt(i) == '-' && s.charAt(i + 1) == '-') {
+                sb.append("2");
+                i++;
+            }
+        }
+
+        System.out.println(sb.toString());
+    }
+}

Divisions/Beta/Round4/BeforeAnExam.java

@@ -0,0 +1,43 @@
+package Divisions.Beta.Round4;
+//code by senurah
+public class BeforeAnExam {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int d = scanner.nextInt();
+        int sumTime = scanner.nextInt();
+        int[] minTimes = new int[d];
+        int[] maxTimes = new int[d];
+        int minTotal = 0;
+        int maxTotal = 0;
+        for (int i = 0; i < d; i++) {
+            minTimes[i] = scanner.nextInt();
+            maxTimes[i] = scanner.nextInt();
+            minTotal += minTimes[i];
+            maxTotal += maxTimes[i];
+        }
+
+        if (sumTime < minTotal || sumTime > maxTotal) {
+            System.out.println("NO");
+        } else {
+            System.out.println("YES");
+            int[] schedule = new int[d];
+
+            for (int i = 0; i < d; i++) {
+                schedule[i] = minTimes[i];
+            }
+
+            int remainingTime = sumTime - minTotal;
+
+            for (int i = 0; i < d && remainingTime > 0; i++) {
+                int availableTime = maxTimes[i] - minTimes[i];
+                int timeToAdd = Math.min(remainingTime, availableTime);
+                schedule[i] += timeToAdd;
+                remainingTime -= timeToAdd;
+            }
+
+            for (int i = 0; i < d; i++) {
+                System.out.print(schedule[i] + " ");
+            }
+        }
+    }
+}

Divisions/Beta/Round57/UltraFastMathematician.java

@@ -0,0 +1,19 @@
+package Divisions.Beta.Round57;
+//code by senurah
+public class UltraFastMathematician {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        String a = scanner.next();
+        String b = scanner.next();
+
+        if (a.length() == b.length()) {
+            for (int i = 0; i < a.length(); i++) {
+                if (a.charAt(i) == b.charAt(i)) {
+                    System.out.print("0");
+                } else {
+                    System.out.print("1");
+                }
+            }
+        }
+    }
+}

Divisions/Beta/Round69/PanoramixsPrediction.java

@@ -0,0 +1,41 @@
+package Divisions.Beta.Round69;
+//code by senurah
+public class PanoramixsPrediction {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int n = scanner.nextInt();
+        int m = scanner.nextInt();
+
+        if (n >= 2 && n <= 50 && m >= 2 && m <= 50) {
+            int nextPrime = 0;
+            for (int i = n + 1; i <= m; i++) {
+                if (isPrime(i)) {
+                    nextPrime = i;
+                    break;
+                }
+            }
+
+            if (nextPrime == m) {
+                System.out.println("YES");
+            } else {
+                System.out.println("NO");
+            }
+        }
+
+        scanner.close();
+    }
+
+    private static boolean isPrime(int num) {
+        if (num <= 1) {
+            return false;
+        }
+        for (int i = 2; i <= Math.sqrt(num); i++) {
+            if (num % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+
+}

Divisions/Beta/Round8/Cplusequal.java

@@ -0,0 +1,31 @@
+package Divisions.Beta.Round8;
+//code by senurah
+import java.util.Scanner;
+
+public class Cplusequal {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int T = scanner.nextInt();
+        StringBuilder result = new StringBuilder();
+
+        for (int t = 0; t < T; t++) {
+            int a = scanner.nextInt();
+            int b = scanner.nextInt();
+            int n = scanner.nextInt();
+            int count = 0;
+
+            while (a <= n && b <= n) {
+                if (a < b) {
+                    a += b;
+                } else {
+                    b += a;
+                }
+                count++;
+            }
+            result.append(count).append("\n");
+        }
+
+        System.out.print(result);
+    }
+}
+

Divisions/Beta/Round9/DieRoll.java

@@ -0,0 +1,27 @@
+package Divisions.Beta.Round9;
+
+import java.util.Scanner;
+
+//code by senurah
+public class DieRoll {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+
+        int y = scanner.nextInt();
+        int w = scanner.nextInt();
+
+        int maxRoll = Math.max(y, w);
+        int favorableOutcomes = 6 - maxRoll + 1;
+
+        switch (favorableOutcomes) {
+            case 1: System.out.println("1/6"); break;
+            case 2: System.out.println("1/3"); break;
+            case 3: System.out.println("1/2"); break;
+            case 4: System.out.println("2/3"); break;
+            case 5: System.out.println("5/6"); break;
+            case 6: System.out.println("1/1"); break;
+        }
+
+        scanner.close();
+    }
+}

Divisions/Div2/Round105/InsomniaCure.java

@@ -0,0 +1,25 @@
+package Divisions.Div2.Round105;
+//code by senurah
+public class InsomniaCure {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int k = scanner.nextInt();
+        int l = scanner.nextInt();
+        int m = scanner.nextInt();
+        int n = scanner.nextInt();
+        int d = scanner.nextInt();
+
+        int count = 0;
+        if(k>=1 && k<=10 && l>=1 && l<=10 && m>=1 && m<=10 && n>=1 && n<=10 && d>=1 && d<=100000){
+            for (int i = 1; i <= d; i++) {
+                if (i % k == 0 || i % l == 0 || i % m == 0 || i % n == 0) {
+                    count++;
+                }
+            }
+
+            System.out.println(count);
+
+        }
+
+    }
+}

Divisions/Div2/Round107/SoftDrinking.java

@@ -0,0 +1,22 @@
+package Divisions.Div2.Round107;
+//code by senurah
+public class SoftDrinking {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int n = scanner.nextInt();
+        int k = scanner.nextInt();
+        int l = scanner.nextInt();
+        int c = scanner.nextInt();
+        int d = scanner.nextInt();
+        int p = scanner.nextInt();
+        int nl = scanner.nextInt();
+        int np = scanner.nextInt();
+
+        int totalDrink = k * l;
+        int totalLime = c * d;
+        int totalSalt = p;
+
+        int totalToast = Math.min(totalDrink / nl, Math.min(totalLime, totalSalt / np)) / n;
+        System.out.println(totalToast);
+    }
+}

Divisions/Div2/Round109/I_love_username.java

@@ -0,0 +1,27 @@
+package Divisions.Div2.Round109;
+//code by senurah
+public class I_love_username {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int n = scanner.nextInt();
+        int[] arr = new int[n];
+        for (int i = 0; i < n; i++) {
+            arr[i] = scanner.nextInt();
+        }
+
+        int max = arr[0];
+        int min = arr[0];
+        int count = 0;
+        for (int i = 1; i < n; i++) {
+            if (arr[i] > max) {
+                max = arr[i];
+                count++;
+            } else if (arr[i] < min) {
+                min = arr[i];
+                count++;
+            }
+        }
+
+        System.out.println(count);
+    }
+}

Divisions/Div2/Round126/Drinks.java

@@ -0,0 +1,19 @@
+package Divisions.Div2.Round126;
+//code by senurah
+public class Drinks {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int n = scanner.nextInt();
+        if(n>=1 && n<=100){
+            int[] arr = new int[n];
+            for (int i = 0; i < n; i++) {
+                arr[i] = scanner.nextInt();
+            }
+            double sum = 0;
+            for (int i = 0; i < n; i++) {
+                sum += arr[i];
+            }
+            System.out.println(sum/n);
+        }
+    }
+}

Divisions/Div2/Round141/Isyourhorseshoeontheotherhoof.java

@@ -0,0 +1,24 @@
+package Divisions.Div2.Round141;
+//code by senurah
+public class Isyourhorseshoeontheotherhoof {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int[] arr = new int[4];
+        for (int i = 0; i < 4; i++) {
+            arr[i] = scanner.nextInt();
+        }
+
+        int count = 0;
+        for (int i = 0; i < 4; i++) {
+            for (int j = i + 1; j < 4; j++) {
+                if (arr[i] == arr[j]) {
+                    count++;
+                    break;
+                }
+            }
+        }
+
+        System.out.println(count);
+
+    }
+}

Divisions/Div2/Round163/QueueAtTheSchool.java

@@ -0,0 +1,24 @@
+package Divisions.Div2.Round163;
+//code by senurah
+public class QueueAtTheSchool {
+    public static void main(String[] args) {
+        java.util.Scanner scanner = new java.util.Scanner(System.in);
+        int n = scanner.nextInt();
+        int t = scanner.nextInt();
+        scanner.nextLine();
+        if(n>=1 && n<=50 && t>=1 && t<=50){
+            String s = scanner.nextLine();
+            char[] arr = s.toCharArray();
+            for (int i = 0; i < t; i++) {
+                for (int j = 0; j < n - 1; j++) {
+                    if (arr[j] == 'B' && arr[j + 1] == 'G') {
+                        arr[j] = 'G';
+                        arr[j + 1] = 'B';
+                        j++;
+                    }
+                }
+            }
+            System.out.println(new String(arr));
+        }
+    }
+}