🎨 Update

UltiRequiem · UltiRequiem · commit 571d411f9d76 · 2021-08-03T18:41:34.000-05:00
diff --git a/easy/32_default_dict.py b/easy/32_default_dict.py
@@ -1,11 +1,16 @@
 from collections import defaultdict
 
-d = defaultdict(list)
 
-n, m = map(int, input().split())
+def run():
+    d = defaultdict(list)
 
-for i in range(1, n + 1):
-    d[input()].append(str(i))
+    n, m = map(int, input().split())
 
-for i in range(m):
-    print(" ".join(d[input()]) or -1)
+    for i in range(1, n + 1):
+        d[input()].append(str(i))
+
+    for i in range(m):
+        print(" ".join(d[input()]) or -1)
+
+if __name__ == "__main__":
+    run()
diff --git a/easy/34_exceptions.py b/easy/34_exceptions.py
@@ -0,0 +1,11 @@
+def main():
+    for _ in range(int(input())):
+        try:
+            a, b = map(int, input().split())
+            print(a // b)
+        except BaseException as e:
+            print("Error Code:", e)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/easy/35_coolections_named_tuple.py b/easy/35_coolections_named_tuple.py
@@ -0,0 +1,11 @@
+from collections import namedtuple
+
+
+def run():
+    n, score = int(input()), namedtuple("Score", input().split())
+    scores = [score(*input().split()).MARKS for i in range(n)]
+    print("%.2f" % (sum(map(int, scores)) / n))
+
+
+if __name__ == "__main__":
+    run()
diff --git a/easy/36_ord_dict.py b/easy/36_ord_dict.py
@@ -0,0 +1,15 @@
+from collections import OrderedDict
+
+
+def run():
+    d = OrderedDict()
+
+    for _ in range(int(input())):
+        item, _, quantity = input().rpartition(" ")
+        d[item] = d.get(item, 0) + int(quantity)
+    for item, quantity in d.items():
+        print(item, quantity)
+
+
+if __name__ == "__main__":
+    run()
diff --git a/easy/37_symetric_differece.py b/easy/37_symetric_differece.py
@@ -0,0 +1,6 @@
+def run():
+    a, b = [set(input().split()) for _ in range(4)][1::2]
+    print(*sorted(a ^ b, key=int), sep="\n")
+
+if __name__ == "__main__":
+    run()
diff --git a/easy/38_combinations.py b/easy/38_combinations.py
@@ -0,0 +1,12 @@
+from itertools import combinations
+
+
+def run():
+    s, n = input().split()
+
+    for i in range(1, int(n) + 1):
+        for j in combinations(sorted(s), i):
+            print("".join(j))
+
+if __name__ == "__main__":
+    run()
diff --git a/easy/39_incorrect_regex.py b/easy/39_incorrect_regex.py
@@ -0,0 +1,14 @@
+import re
+
+
+def is_valid_regex(regex):
+    try:
+        re.compile(regex)
+    except re.error:
+        return False
+    return True
+
+
+if __name__ == "__main__":
+    for _ in range(int(input())):
+        print(is_valid_regex(input()))
diff --git a/easy/40_powers.py b/easy/40_powers.py
@@ -0,0 +1,7 @@
+def main():
+    a, b, m = [int(input()) for _ in "123"]
+    print(pow(a, b), pow(a, b, m), sep="\n")
+
+
+if __name__ == "__main__":
+    main()
diff --git a/easy/41_mod_vidmod.py b/easy/41_mod_vidmod.py
@@ -0,0 +1,6 @@
+def main(a: int, b: int) -> str:
+    return "{0}\n{1}\n({0}, {1})".format(*divmod(a, b))
+
+
+if __name__ == "__main__":
+    print(main(int(input()), int(input())))
diff --git a/easy/42_inter_op.py b/easy/42_inter_op.py
@@ -0,0 +1,9 @@
+def main() -> int:
+    _, a = input(), set(input().split())
+    _, b = input(), set(input().split())
+
+    return len(a.intersection(b))
+
+
+if __name__ == "__main__":
+    print(main())
diff --git a/easy/43_set_union_op.py b/easy/43_set_union_op.py
