git reimport

archive/2018.09/2018.09.30 - unsorted/TaskATwo.java

@@ -0,0 +1,68 @@
+package chelper;
+
+import java.util.ArrayList;
+import java.util.HashSet;
+
+import io.InputReader;
+import io.OutputWriter;
+import misc.GCJSolution;
+import misc.SimpleSavingChelperSolution;
+
+
+public class TaskATwo extends GCJSolution {
+
+  public void solve(int testNumber, InputReader in, OutputWriter out) {
+    wrapSolve(testNumber, in, out);
+  }
+
+
+
+  ArrayList<Integer> gen() {
+    ArrayList<Integer> res = new ArrayList<>();
+
+    for (int i = 0; i < 26; i++) {
+      res.add(0);
+    }
+
+    return res;
+  }
+  
+  @Override
+  public void solve(int testNumber) {
+    HashSet<ArrayList<Integer>> set = new HashSet<>();
+    int n = in.nextInt();
+    char[] a = in.nextString().toCharArray();
+    char[] b = in.nextString().toCharArray();
+
+
+    for (int i = 0; i < n; i++) {
+      for (int j = i + 1; j <= n; j++) {
+        ArrayList<Integer> chars = gen();
+
+        for (int k = i; k < j; k++) {
+          chars.set(b[k] - 'A', chars.get(b[k] - 'A') + 1);
+        }
+
+        set.add(chars);
+      }
+    }
+
+    int res = 0;
+
+    for (int i = 0; i < n; i++) {
+      for (int j = i + 1; j <= n; j++) {
+        ArrayList<Integer> chars = gen();
+
+        for (int k = i; k < j; k++) {
+          chars.set(a[k] - 'A', chars.get(a[k] - 'A') + 1);
+        }
+
+        if (set.contains(chars)) {
+          res++;
+        }
+      }
+    }
+
+    out.println(res);
+  }
+}