No vids

lib/production/CompetitiveProgramming/Notes/GCD.md

@@ -0,0 +1,38 @@
+# GCD OF A Number / HCF
+If we subtract smaller number from the greater number, the GCD
+of the number doesn't change. Hence this is the concept of the 
+basic euclidean algorithm
+````
+static int gcd(int a, int b)
+    {
+        // Everything divides 0
+        if (a == 0)
+          return b;
+        if (b == 0)
+          return a;
+
+        // base case
+        if (a == b)
+            return a;
+
+        // a is greater
+        if (a > b)
+            return gcd(a-b, b);
+        return gcd(a, b-a);
+    }
+````
+
+##Extended Euclidean Algorithm 
+Now instead of subtraction, we find the mod of the number and stop
+when the number/remainder becomes 0.
+
+``` Euclidiean Algorithm
+//Euclidiean algorithm
+ static long gcd(long a, long b){
+
+        if(b == 0){
+            return a;
+        }
+        return gcd(b, a%b);
+    }
+```

lib/production/CompetitiveProgramming/Notes/SieveofEratosthenes.md

@@ -0,0 +1,24 @@
+##Sieve of Eratoshenes
+Complexity: O(NloglogN)
+
+The basic idea is to mark the numbers as composite which are multiple or factors
+of some other numbers.
+
+```
+private static boolean[] generatePrime() {
+        boolean a[] = new boolean[1000000];
+        for (int i = 0; i < a.length; i++) {
+            a[i] = true;
+        }
+
+        for (int p = 2; p * p < a.length; p++) {
+            if (a[p]) {
+                for (int i = p * p; i < a.length; i+=p) {
+                    a[i] = false;
+                }
+            }
+        }
+
+        return a;
+    }
+```

src/AtCoder/contest212/A.java

@@ -0,0 +1,19 @@
+package AtCoder.contest212;
+
+import java.util.Scanner;
+
+public class A {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int a = sc.nextInt();
+        int b = sc.nextInt();
+        if (a == 0 && b>0) {
+            System.out.println("Silver");
+        }else if(b==0 && a>0) {
+            System.out.println("Gold");
+        }else{
+            System.out.println("Alloy");
+        }
+
+    }
+}

src/AtCoder/contest212/B.java

@@ -0,0 +1,29 @@
+package AtCoder.contest212;
+
+import java.util.Scanner;
+
+public class B {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        String s = sc.next();
+        if(s.charAt(0)==s.charAt(1) && s.charAt(1)==s.charAt(2) && s.charAt(2) == s.charAt(3)){
+            System.out.println("Weak");
+        }else {
+            //check for follows
+            boolean weak = true;
+            for (int i = 0; i < s.length()-1; i++) {
+                int a = s.charAt(i)-48;
+                int b = s.charAt(i+1)-48;
+                if((a+1) % 10 != b %10){
+                    weak = false;
+                }
+
+            }
+            if(weak){
+                System.out.println("Weak");
+            }else{
+                System.out.println("Strong");
+            }
+        }
+    }
+}

src/AtCoder/contest212/c.java

@@ -0,0 +1,19 @@
+package AtCoder.contest212;
+
+import java.util.Scanner;
+
+public class c {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int m = sc.nextInt();
+        int a[] =new int[n];
+        int b[] = new int[m];
+        for (int i = 0; i < n; i++) {
+            a[i] = sc.nextInt();
+        }
+        for (int i = 0; i < m; i++) {
+            b[i] = sc.nextInt();
+        }
+    }
+}

src/AtCoder/twoonethree/A.java

@@ -0,0 +1,13 @@
+package AtCoder.twoonethree;
+
+import java.util.Scanner;
+
+public class A {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int a = sc.nextInt();
+        int b = sc.nextInt();
+        int c = a^b;
+        System.out.println(c);
+    }
+}

src/AtCoder/twoonethree/B.java

@@ -0,0 +1,24 @@
+package AtCoder.twoonethree;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class B {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        long arr[] = new long[n];
+        for (int i = 0; i < n; i++) {
+            arr[i] = sc.nextLong();
+        }
+        long[] b = arr.clone();
+        Arrays.sort(b);
+        int i = 0;
+        for (i = 0; i < n; i++) {
+            if(arr[i] == b[b.length-2]) {
+                break;
+            }
+        }
+        System.out.println(i+1);
+    }
+}

src/AtCoder/twoonethree/C.java

@@ -0,0 +1,21 @@
+package AtCoder.twoonethree;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class C {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        long h = sc.nextLong();
+        long w = sc.nextLong();
+        long n = sc.nextLong();
+        int x[] = new int[(int)n];
+        int y[] = new int[(int)n];
+        for (int i = 0; i < n; i++) {
+            x[i] = sc.nextInt();
+            y[i] = sc.nextInt();
+        }
+        Arrays.sort(x);
+        Arrays.sort(y);
+    }
+}

src/Codeforces/A.java

@@ -0,0 +1,16 @@
+package Codeforces;
+
+import java.util.Scanner;
+import java.util.Stack;
+
+public class A {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        while (t-- >= 1) {
+
+        }
+    }
+
+
+}

src/Codeforces/B.java

@@ -0,0 +1,14 @@
+package Codeforces;
+
+import java.util.Scanner;
+
+public class B {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        while (t-- >= 1) {
+
+        }
+    }
+
+}

src/Codeforces/C.java

@@ -0,0 +1,46 @@
+package Codeforces;
+
+import java.util.Scanner;
+
+public class C {
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        long number[] = new long[t];
+        long sum = 0;
+        long max = Long.MIN_VALUE;
+        long min = Long.MAX_VALUE;
+        for (int i = 0; i < t; i++) {
+            long a = sc.nextLong();
+            sum = sum + a;
+            if (a < min) {
+                min = a;
+            }
+            if (a > max) {
+                max = a;
+            }
+        }
+        int m = sc.nextInt();
+        for (int i = 0; i < m; i++) {
+            long x = sc.nextLong();
+            long y = sc.nextLong();
+            long sumEqual = sum;
+            long coins = 0;
+            if (x < max) {
+            } else {
+                coins = x - max;
+                sum = sum+coins;
+            }
+            sum = sum-x;
+
+            if (y < sum) {
+            } else {
+                long coins2 = y - sum;
+                coins += coins2;
+            }
+            sum = sumEqual;
+            System.out.println(coins);
+        }
+    }
+}

src/Codeforces/D.java

@@ -0,0 +1,14 @@
+package Codeforces;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class D {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        while (t-- >= 1) {
+        }
+    }
+}

src/Codeforces/E1.java

@@ -0,0 +1,45 @@
+package Codeforces;
+
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class E1 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        while (t-- >= 1) {
+            int n = sc.nextInt();
+            ArrayList<Long> arr = new ArrayList<Long>();
+            for (int i = 0; i < n; i++) {
+                arr.add(sc.nextLong());
+            }
+            long length = 0;
+            long finalnumber = 0;
+            for (int i = 0; i < n; i++) {
+                long addingToBeg = (long) (Math.pow(10, length) * arr.get(i));
+                long addingToEnd = (long) (Math.pow(10, 1) * finalnumber);
+                if (addingToBeg + finalnumber > addingToEnd + arr.get(i)) {
+                    finalnumber = addingToEnd + arr.get(i);
+                } else {
+                    finalnumber = addingToBeg + finalnumber;
+                }
+                length++;
+            }
+            ArrayList<Long> finalAns = new ArrayList<>();
+            long ff = finalnumber;
+            while (ff != 0) {
+                finalAns.add(0, ff % 10);
+                ff = ff / 10;
+            }
+
+            if (finalAns.size() == 0) {
+                System.out.println(arr.get(0));
+            } else {
+                for (int i = 0; i < finalAns.size(); i++) {
+                    System.out.print(finalAns.get(i) + " ");
+                }
+                System.out.println();
+            }
+        }
+    }
+}

src/Codeforces/Problem1033A.java

@@ -0,0 +1,23 @@
+package Codeforces;
+
+import java.util.Scanner;
+
+public class Problem1033A {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int q1 = sc.nextInt();
+        int q2 = sc.nextInt();
+        int k1 = sc.nextInt();
+        int k2 = sc.nextInt();
+        int c1 = sc.nextInt();
+        int c2 = sc.nextInt();
+        if ((c1 > q1 && k1 > q1 && c2 > q2 && k2 > q2) || (k1 < q1 && k2 > q2 && c1 < q1 && c2 > q2) ||
+                (c1 < q1 && k1 < q1 && c2 < q2 && k2 < q2) ||
+                (k1>q1 && c1>q1 && k2<q2 && c2<q2)) {
+            System.out.println("YES");
+        }else{
+            System.out.println("NO");
+        }
+    }
+}

src/Codeforces/Problem1036A.java

@@ -0,0 +1,12 @@
+package Codeforces;
+
+import java.util.Scanner;
+
+public class Problem1036A {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        long n = sc.nextLong();
+        long k = sc.nextLong();
+        System.out.println((n+k-1)/n);
+    }
+}