git reimport

archive/2017.10/2017.10.15 - unsorted/A.java

@@ -0,0 +1,40 @@
+package chelper;
+
+import io.InputReader;
+import io.OutputWriter;
+import misc.SimpleSavingChelperSolution;
+
+
+public class A extends SimpleSavingChelperSolution {
+
+  public void solve(int testNumber, InputReader in, OutputWriter out) {
+    wrapSolve(testNumber, in, out);
+  }
+
+  @Override
+  public void solve(int testNumber) {
+    int n = in.nextInt();
+    int m = in.nextInt();
+    int[] a = in.nextIntArray(n);
+    int[] b = in.nextIntArray(m);
+
+    for (int i = 1; i < 1000; i++) {
+      String s = Integer.toString(i);
+
+      boolean ok1 = false;
+      for (int j : a) {
+        ok1 |= s.contains(Integer.toString(j));
+      }
+
+      boolean ok2 = false;
+      for (int j : b) {
+        ok2 |= s.contains(Integer.toString(j));
+      }
+
+      if (ok1 && ok2) {
+        out.println(i);
+        break;
+      }
+    }
+  }
+}

archive/2017.10/2017.10.15 - unsorted/A.task

@@ -0,0 +1,33 @@
+1 A
+6 SINGLE
+8 STANDARD
+9 input.txt
+8 STANDARD
+10 output.txt
+2
+0
+13 2 3
+4 2
+5 7 6
+2 25
+1
+1
+35 8 8
+1 2 3 4 5 6 7 8
+8 7 6 5 4 3 2 1
+1 1
+1
+11 src/chelper
+16 -Xmx256m -Xss64m
+4 Main
+9 chelper.A
+39 net.egork.chelper.checkers.TokenChecker
+0 
+0
+10 2017.10.15
+0 
+1
+14 io.InputReader
+15 io.OutputWriter
+0
+0

archive/2017.10/2017.10.15 - unsorted/B.java

@@ -0,0 +1,39 @@
+package chelper;
+
+import io.InputReader;
+import io.OutputWriter;
+import misc.SimpleSavingChelperSolution;
+
+
+public class B extends SimpleSavingChelperSolution {
+
+  public void solve(int testNumber, InputReader in, OutputWriter out) {
+    wrapSolve(testNumber, in, out);
+  }
+
+  @Override
+  public void solve(int testNumber) {
+    int n = in.nextInt();
+    int k = in.nextInt();
+
+    int[] a = in.nextIntArray(n);
+
+    int globalMin = a[0];
+    int globalMax = a[0];
+
+    for (int i : a) {
+      globalMax = Math.max(globalMax, i);
+      globalMin = Math.min(globalMin, i);
+    }
+
+    int twoMax = Math.max(a[0], a[n - 1]);
+
+    if (k == 1) {
+      out.println(globalMin);
+    } else if (k == 2) {
+      out.println(twoMax);
+    } else {
+      out.println(globalMax);
+    }
+  }
+}

archive/2017.10/2017.10.15 - unsorted/B.task

@@ -0,0 +1,31 @@
+1 B
+6 SINGLE
+8 STANDARD
+9 input.txt
+8 STANDARD
+10 output.txt
+2
+0
+13 5 2
+1 2 3 4 5
+1 5
+1
+1
+18 5 1
+-4 -5 -3 -2 -1
+2 -5
+1
+11 src/chelper
+16 -Xmx256m -Xss64m
+4 Main
+9 chelper.B
+39 net.egork.chelper.checkers.TokenChecker
+0 
+0
+10 2017.10.15
+0 
+1
+14 io.InputReader
+15 io.OutputWriter
+0
+0

archive/2017.10/2017.10.15 - unsorted/E.java

@@ -0,0 +1,131 @@
+package chelper;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.TreeMap;
+
+import io.InputReader;
+import io.OutputWriter;
+import misc.SimpleSavingChelperSolution;
+
+
+public class E extends SimpleSavingChelperSolution {
+
+  private int[] x;
+  private int[] y;
+  private int n;
+  private Map<Integer, Integer> xMap;
+  private Map<Integer, Integer> yMap;
+  private List<Set<Integer>> edges;
+  private boolean[] visited;
+  private long MOD;
+
+  public void solve(int testNumber, InputReader in, OutputWriter out) {
+    wrapSolve(testNumber, in, out);
+  }
+
+  @Override
+  public void solve(int testNumber) {
+    n = in.nextInt();
+
+    x = new int[n];
+    y = new int[n];
+
+    xMap = new TreeMap<>();
+    yMap = new TreeMap<>();
+
+    edges = new ArrayList<>();
+
+    for (int i = 0; i < n; i++) {
+      edges.add(new HashSet<>());
+    }
+
+    Map<Integer, Integer> prevX = new HashMap<>();
+    Map<Integer, Integer> prevY = new HashMap<>();
+
+    for (int i = 0; i < n; i++) {
+      x[i] = in.nextInt();
+      y[i] = in.nextInt();
+
+      xMap.put(x[i], xMap.getOrDefault(x[i], 0) + 1);
+      yMap.put(y[i], yMap.getOrDefault(y[i], 0) + 1);
+
+      Integer pX = prevX.get(x[i]);
+      Integer pY = prevY.get(y[i]);
+
+      if (pX != null) {
+        edges.get(pX).add(i);
+        edges.get(i).add(pX);
+      }
+      if (pY != null) {
+        edges.get(pY).add(i);
+        edges.get(i).add(pY);
+      }
+
+      prevX.put(x[i], i);
+      prevY.put(y[i], i);
+    }
+
+    visited = new boolean[n];
+
+    long ans = 1;
+
+    MOD = 1000000007;
+
+    for (int i = 0; i < n; i++) {
+      if (visited[i]) {
+        continue;
+      }
+
+      List<Integer> res = new ArrayList<>();
+      dfs(i, res);
+
+      Set<Integer> usedX = new HashSet<>();
+      Set<Integer> usedY = new HashSet<>();
+
+      for (Integer j : res) {
+        usedX.add(x[j]);
+        usedY.add(y[j]);
+      }
+
+      int K = usedX.size() + usedY.size();
+      if (res.size() >= K) {
+        ans = ans * twopow(K) % MOD;
+      } else {
+        ans = ans * ((twopow(K) - 1 + MOD) % MOD) % MOD;
+      }
+    }
+
+
+    out.println(ans);
+  }
+
+  long twopow(int n) {
+    if (n == 0) {
+      return 1;
+    }
+    if (n % 2 == 0) {
+      long t = twopow(n / 2);
+      return t * t % MOD;
+    }
+    return twopow(n - 1) * 2 % MOD;
+  }
+
+  void dfs(int v, List<Integer> res) {
+    if (visited[v]) {
+      return;
+    }
+    visited[v] = true;
+    res.add(v);
+
+    for (int j : edges.get(v)) {
+      dfs(j, res);
+    }
+  }
+}

archive/2017.10/2017.10.15 - unsorted/E.task

@@ -0,0 +1,35 @@
+1 E
+6 SINGLE
+8 STANDARD
+9 input.txt
+8 STANDARD
+10 output.txt
+2
+0
+17 4
+1 1
+1 2
+2 1
+2 2
+2 16
+1
+1
+11 2
+-1 -1
+0 1
+1 9
+1
+11 src/chelper
+16 -Xmx256m -Xss64m
+4 Main
+9 chelper.E
+39 net.egork.chelper.checkers.TokenChecker
+0 
+0
+10 2017.10.15
+0 
+1
+14 io.InputReader
+15 io.OutputWriter
+0
+0

archive/2017.10/2017.10.15 - unsorted/С.java

@@ -0,0 +1,58 @@
+package chelper;
+
+import java.util.Arrays;
+
+import io.InputReader;
+import io.OutputWriter;
+import misc.SimpleSavingChelperSolution;
+
+
+public class С extends SimpleSavingChelperSolution {
+
+  public void solve(int testNumber, InputReader in, OutputWriter out) {
+    wrapSolve(testNumber, in, out);
+  }
+
+  @Override
+  public void solve(int testNumber) {
+    int q = in.nextInt();
+
+    int M = 1000;
+    boolean[] primes = new boolean[M];
+    Arrays.fill(primes, true);
+    primes[0] = false;
+    primes[1] = true;
+    for (int i = 2; i < M; i++) {
+      if (!primes[i]) {
+        continue;
+      }
+
+      for (int j = i * 2; j < M; j += i) {
+        primes[j] = false;
+      }
+    }
+
+    int[] dp = new int[M];
+    Arrays.fill(dp, -1);
+
+    for (int i = 1; i < M; i++) {
+      if (!primes[i]) {
+        dp[i] = 1;
+      }
+      for (int j = 1; j < i; j++) {
+        if (!primes[j] && !primes[i - j]) {
+          dp[i] = Math.max(dp[i], dp[j] + dp[i - j]);
+        }
+      }
+    }
+
+    for (int i = 0; i < q; i++) {
+      int n = in.nextInt();
+      if (n < M) {
+        out.println(dp[n]);
+      } else {
+        out.println(n / 4 - n % 2);
+      }
+    }
+  }
+}

archive/2017.10/2017.10.15 - unsorted/С.task

@@ -0,0 +1,42 @@
+2 С
+6 SINGLE
+8 STANDARD
+9 input.txt
+8 STANDARD
+10 output.txt
+3
+0
+4 1
+12
+1 3
+1
+1
+5 2
+6
+8
+3 1
+2
+1
+2
+7 3
+1
+2
+3
+8 -1
+-1
+-1
+1
+11 src/chelper
+16 -Xmx256m -Xss64m
+4 Main
+10 chelper.С
+39 net.egork.chelper.checkers.TokenChecker
+0 
+0
+10 2017.10.15
+0 
+1
+14 io.InputReader
+15 io.OutputWriter
+0
+0