Added 26 solutions

2017-02-18 23:43:07 -06:00
parent 34e66564f9
commit 7034e7127c
45 changed files with 1458 additions and 89 deletions
@@ -0,0 +1,62 @@
+//     Author: Rodney Shaghoulian
+//     Github: github.com/rshaghoulian
+// HackerRank: hackerrank.com/rshaghoulian
+
+import java.util.Scanner;
+import java.util.BitSet;
+
+public class Solution {
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int N = scan.nextInt();
+        int M = scan.nextInt();
+        BitSet B1 = new BitSet(N);
+        BitSet B2 = new BitSet(N);
+        while (M-- > 0) {
+            String str = scan.next();
+            int a      = scan.nextInt();
+            int b      = scan.nextInt();
+            switch (str) {
+                case "AND":
+                    if (a == 1) {
+                        B1.and(B2);
+                    } else {
+                        B2.and(B1);
+                    }
+                    break;
+                case "OR":
+                    if (a == 1) {
+                        B1.or(B2);
+                    } else {
+                        B2.or(B1);
+                    }
+                    break;
+                case "XOR":
+                    if (a == 1) {
+                        B1.xor(B2);
+                    } else {
+                        B2.xor(B1);
+                    }
+                    break;
+                case "FLIP":
+                    if (a == 1) {
+                        B1.flip(b);
+                    } else {
+                        B2.flip(b);
+                    }
+                    break;
+                case "SET":
+                    if (a == 1) {
+                        B1.set(b);
+                    } else {
+                        B2.set(b);
+                    }
+                    break;
+                default:
+                    break;
+            }
+            System.out.println(B1.cardinality() + " " + B2.cardinality());
+        }
+    }
+}
+