ARC104-ARC106

Author: IsHYuhi

Diff for: ARC/ARC104/A.py

@@ -0,0 +1,7 @@
+a, b = map(int, input().split())
+
+for i in range(-100, 101):
+    for j in range(-100, 101):
+        if i+j == a and i-j == b:
+            print(i, j)
+            exit()

Diff for: ARC/ARC104/B.py

@@ -0,0 +1,19 @@
+#AC with PyPy3
+from collections import Counter
+n, s = input().split()
+n = int(n)
+
+count_org = Counter(s)
+count = 0
+
+for i in range(1, n+1)[::-1]:
+    count_t = count_org.copy()
+    for j in range(i):
+
+        if count_t['A'] == count_t['T'] and count_t['C'] == count_t['G']:
+            count += 1
+
+        count_t[s[j]] -= 1
+    count_org[s[i-1]] -= 1
+
+print(count)

Diff for: ARC/ARC105/A.py

@@ -0,0 +1,17 @@
+from itertools import combinations
+
+abcd = list(map(int, input().split()))
+total = sum(abcd)
+
+for i in range(1, 5):
+    comb = list(combinations(abcd, i))
+
+    for j in comb:
+        choose = sum([j for j in list(j)])
+
+        if  choose == total - choose:
+            print('Yes')
+            exit()
+
+print('No')
+

Diff for: ARC/ARC105/B.py

@@ -0,0 +1,9 @@
+from functools import reduce
+import math
+
+def my_gcd(numbers):
+    return reduce(math.gcd, numbers)
+
+n = int(input())
+a = list(map(int, input().split()))
+print(my_gcd(a))

Diff for: ARC/ARC106/A.py

@@ -0,0 +1,8 @@
+n = int(input())
+
+for a in range(1, 38):
+    for b in range(1, 27):
+        if 3**a + 5**b == n:
+            print(a, b)
+            exit()
+print(-1)

Diff for: ARC/ARC106/B.py

@@ -0,0 +1,38 @@
+from collections import deque
+
+n, m = map(int, input().split())
+a = list(map(int, input().split()))
+b = list(map(int, input().split()))
+visited = [False]*n
+graph = [[] for i in range(n)]
+
+for i in range(m):
+    c, d = map(int, input().split())
+    graph[c-1].append(d-1)
+    graph[d-1].append(c-1)
+
+def bfs(start):
+    q = deque([start])
+    visited[start] = True
+    ans = []
+    while q:
+        now = q.popleft()
+        ans.append(now)
+        for i in graph[now]:
+            if visited[i] == False:
+                visited[i] = True
+                q.append(i)
+
+    return ans
+
+for v in range(n):
+
+    if visited[v] == False:
+        nodes = bfs(v)
+
+        if sum(a[idx] for idx in nodes) != sum(b[idx] for idx in nodes):
+            print('No')
+            exit()
+
+print('Yes')
+