Add examples

atcoder/dsu.py

@@ -59,25 +59,3 @@ def groups(self) -> typing.List[typing.List[int]]:
             result[leader_buf[i]].append(i)
 
         return list(filter(lambda r: r, result))
-
-
-# https://atcoder.jp/contests/practice2/tasks/practice2_a
-def main() -> None:
-    import sys
-
-    n, q = map(int, sys.stdin.readline().split())
-    dsu = DSU(n)
-
-    for _ in range(q):
-        t, u, v = map(int, sys.stdin.readline().split())
-        if t == 0:
-            dsu.merge(u, v)
-        if t == 1:
-            if dsu.same(u, v):
-                print(1)
-            else:
-                print(0)
-
-
-if __name__ == '__main__':
-    main()

atcoder/fenwicktree.py

@@ -28,26 +28,3 @@ def _sum(self, r: int) -> typing.Any:
             r -= r & -r
 
         return s
-
-
-# https://atcoder.jp/contests/practice2/tasks/practice2_b
-def main() -> None:
-    import sys
-
-    n, q = map(int, sys.stdin.readline().split())
-    fenwick_tree = FenwickTree(n)
-
-    a = map(int, sys.stdin.readline().split())
-    for i, ai in enumerate(a):
-        fenwick_tree.add(i, ai)
-
-    for _ in range(q):
-        t, x, y = map(int, sys.stdin.readline().split())
-        if t == 0:
-            fenwick_tree.add(x, y)
-        if t == 1:
-            print(fenwick_tree.sum(x, y))
-
-
-if __name__ == '__main__':
-    main()

example/dsu_practice.py

@@ -0,0 +1,24 @@
+# https://atcoder.jp/contests/practice2/tasks/practice2_a
+
+from atcoder.dsu import DSU
+
+
+def main() -> None:
+    import sys
+
+    n, q = map(int, sys.stdin.readline().split())
+    dsu = DSU(n)
+
+    for _ in range(q):
+        t, u, v = map(int, sys.stdin.readline().split())
+        if t == 0:
+            dsu.merge(u, v)
+        if t == 1:
+            if dsu.same(u, v):
+                print(1)
+            else:
+                print(0)
+
+
+if __name__ == '__main__':
+    main()

example/fenwick_practice.py

@@ -0,0 +1,25 @@
+# https://atcoder.jp/contests/practice2/tasks/practice2_b
+
+from atcoder.fenwicktree import FenwickTree
+
+
+def main() -> None:
+    import sys
+
+    n, q = map(int, sys.stdin.readline().split())
+    fenwick_tree = FenwickTree(n)
+
+    a = map(int, sys.stdin.readline().split())
+    for i, ai in enumerate(a):
+        fenwick_tree.add(i, ai)
+
+    for _ in range(q):
+        t, x, y = map(int, sys.stdin.readline().split())
+        if t == 0:
+            fenwick_tree.add(x, y)
+        if t == 1:
+            print(fenwick_tree.sum(x, y))
+
+
+if __name__ == '__main__':
+    main()