Adding all previously written code

Author: formidablae

2020/2020-11-21_Round_685_Div_2/A_Subtract_or_Divide.py

@@ -0,0 +1,8 @@
+t = int(input())
+for ts in range(t):
+    n = int(input())
+    if n == 1: print(0)
+    elif n == 2: print(1)
+    elif n == 3: print(2)
+    elif n % 2 == 0: print(2)
+    else: print(3)

2020/2020-11-24_Round_686_Div_3/A_Special_Permutation.py

@@ -0,0 +1,9 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    st = ""
+    for x in range(2, n + 1):
+        st += str(x)
+        st += str(" ")
+    st += "1"
+    print(st)

2020/2020-11-24_Round_686_Div_3/B_Unique_Bid_Auction.py

@@ -0,0 +1,32 @@
+import math
+
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    chosennumbers = list(map(int, input().split()))
+    mimim = math.inf
+    flag = True
+    if len(chosennumbers) == 1:
+        print("1")
+    elif len(chosennumbers) == 2:
+        if chosennumbers[0] == chosennumbers[1]: print("-1")
+        elif chosennumbers[0] < chosennumbers[1]: print("1")
+        else: print("2")
+    else:
+        chosennumberssorted = chosennumbers.copy()
+        chosennumberssorted.sort()
+        while len(chosennumberssorted) > 1:
+            if chosennumberssorted[0] == chosennumberssorted[1]:
+                flag = False
+                number = chosennumberssorted[0]
+                while len(chosennumberssorted) > 0 and chosennumberssorted[0] == number:
+                    chosennumberssorted.pop(0)
+            else:
+                flag = True
+                mimim = chosennumberssorted[0]
+                print(str(chosennumbers.index(chosennumberssorted[0]) + 1))
+                break
+        if not flag and len(chosennumberssorted) == 1:
+            print(str(chosennumbers.index(chosennumberssorted[0]) + 1))
+        elif not flag:
+            print("-1")

2020/2020-11-24_Round_686_Div_3/C_Sequence_Transformation.py

@@ -0,0 +1,27 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    sequence = list(map(int, input().split()))
+    appearen = []
+    for i in range(n):
+        appearen.append(sequence.count(sequence[i]))
+
+    mimumappear = min(appearen)
+    if mimumappear == 1:
+        if appearen[0] == 1 or appearen[n - 1] == 1: print(1)
+        else:
+            if appearen[0] == 2 and appearen[n - 1] == 2:
+                print(1)
+            else:
+                print(2)
+    elif appearen[0] == n: print(0)
+    else:
+        if appearen[0] == mimumappear and appearen[n - 1] == mimumappear:
+            print(str(mimumappear - 1))
+        elif appearen[0] == mimumappear or appearen[n - 1] == mimumappear:
+            print(mimumappear)
+        else:
+            if appearen[0] == mimumappear + 1 and appearen[n - 1] == mimumappear + 1:
+                print(mimumappear)
+            else:
+                print(str(mimumappear + 1))

2020/2020-11-24_Round_686_Div_3/C_Sequence_Transformation_V2.py

@@ -0,0 +1,34 @@
+import math
+
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    sequence = list(map(int, input().split()))
+    minsteps = math.inf
+    for i in range(n):
+        select = sequence[i]
+        j = 0
+        segment = 0
+        countsteps = 0
+        while len(sequence) > 0 and j < len(sequence):
+            if sequence[j] == select:
+                if segment == 0: j = j + 1
+                else:
+                    k = 1
+                    while k < segment + 1 and j - segment < len(sequence):
+                        sequence.pop(j - segment)
+                    countsteps = countsteps + 1
+                    segment = 0
+                    j = j - k - 1
+            else:
+                segment = segment + 1
+                j = j + 1
+        if segment != 0:
+            k = 1
+            while k < segment + 1 and j - segment < len(sequence):
+                sequence.pop(j - segment)
+            countsteps = countsteps + 1
+            segment = 0
+            j = j - k - 1
+        minsteps = min(minsteps, countsteps)
+    print(minsteps)

2020/2020-12-15_Round_690_Div_3/A_Favorite_Sequence.py

@@ -0,0 +1,11 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    seq = list(map(int, input().split()))
+    ans = []
+    for i in range(n // 2):
+        ans.append(seq[i])
+        ans.append(seq[n - i - 1])
+    if len(seq) % 2 != 0:
+        ans.append(seq[len(seq) // 2])
+    print(*ans)

2020/2020-12-15_Round_690_Div_3/B_Last_Years_Substring.py

@@ -0,0 +1,14 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    st = input()
+    if st[0:4] == "2020" or st[n - 4:n] == "2020":
+        print("YES")
+    elif n >= 4 and st[0] == "2" and st[n - 3:n] == "020":
+        print("YES")
+    elif n >= 4 and st[0:2] == "20" and st[n - 2:n] == "20":
+        print("YES")
+    elif n >= 4 and st[0:3] == "202" and st[n - 1] == "0":
+        print("YES")
+    else:
+        print("NO")

2020/2020-12-15_Round_690_Div_3/C_Unique_Number.py

@@ -0,0 +1,21 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    if len(str(n)) == 1:
+        print(n)
+    elif n > 45:
+        print(-1)
+    else:
+        minim = -1
+        digits = [0, 0, 0, 0, 0, 0, 0, 0, 9]
+        i = 7
+        while True:
+            if digits[i] < i + 1:
+                digits[i] += 1
+            else:
+                i -= 1
+                digits[i] += 1
+            if sum(digits) == n:
+                minim = int(''.join(map(str, digits)))
+                break
+        print(minim)

2020/2020-12-15_Round_690_Div_3/D_Add_to_Neighbour_and_Remove.py

@@ -0,0 +1,3 @@
+# T = int(input())
+# for tc in range(T):
+#     n = int(input())

2020/2020-12-15_Round_690_Div_3/E1_Close_Tuples_(easy_version).py

@@ -0,0 +1,23 @@
+# # import itertools
+#
+# T = int(input())
+# for tc in range(T):
+#     n = int(input())
+#     seq = list(map(int, input().split()))
+#     count = 0
+#     seq.sort()
+#     for i in range(n):
+#         for j in range(i + 1, n):
+#             if seq[j] - seq[i] > 2:
+#                 break
+#             for k in range(j + 1, n):
+#                 if seq[k] - seq[i] > 2:
+#                     break
+#                 else:
+#                     count += 1
+#     # comb = itertools.combinations(seq, 3)
+#     # for c in comb:
+#     #     print(c)
+#     #     if max(c) - min(c) <= 2:
+#     #         count += 1
+#     print(count)

2020/2020-12-19_Round_691_Div_2/A_Red-Blue_Shuffle.py

@@ -0,0 +1,55 @@
+# from itertools import permutations
+#
+# T = int(input())
+# for tc in range(T):
+#     n = int(input())
+#     reds = input()
+#     blues = input()
+#     morereds = 0
+#     # summat_r = 0
+#     # summat_b = 0
+#     # for i in range(n):
+#     #     inner_r_sum = 0
+#     #     inner_b_sum = 0
+#     #     # morereds += sum(num > blues[n] for num in reds)
+#     #     # morereds -= sum(num < blues[n] for num in reds)
+#     #     for j in range(n):
+#     #         # if reds[i] > blues[j]:
+#     #         #     morereds += 1
+#     #         # elif reds[i] < blues[j]:
+#     #         #     morereds -= 1
+#     #         if i == 0 and reds[j] == 0:
+#     #             inner_r_sum == inner_r_sum
+#     #         else:
+#     #             inner_r_sum += reds[j] * (n - 1)
+#     #         if i == 0 and blues[j] == 0:
+#     #             inner_b_sum == inner_b_sum
+#     #         else:
+#     #             inner_b_sum += blues[j] * (n - 1)
+#     #     summat_r += inner_r_sum * 10 ** (n - i - 1)
+#     #     summat_b += inner_b_sum * 10 ** (n - i - 1)
+#     # # if morereds > 0:
+#     # #     print("RED")
+#     # # elif morereds < 0:
+#     # #     print("BLUE")
+#     # # else:
+#     # #     print("EQUAL")
+#     # if summat_r > summat_b:
+#     #     print("RED")
+#     # elif summat_r < summat_b:
+#     #     print("BLUE")
+#     # else:
+#     #     print("EQUAL")
+#     perm_r = list(permutations(reds))
+#     perm_b = list(permutations(blues))
+#     for i in range(len(perm_r)):
+#         if perm_r[i] > perm_b[i]:
+#             morereds += 1
+#         elif perm_r[i] < perm_b[i]:
+#             morereds -= 1
+#     if morereds > 0:
+#         print("RED")
+#     elif morereds < 0:
+#         print("BLUE")
+#     else:
+#         print("EQUAL")

2020/2020-12-19_Round_691_Div_2/B_Move_and_Turn.py

@@ -0,0 +1,7 @@
+n = int(input())
+if n % 2 == 0:
+    x = int(n / 2)
+    print(int((x + 1) ** 2))
+else:
+    x = int((n - 1) / 2)
+    print(int(((x + 2) ** 2) + x * (x + 2)))

2020/2020-12-19_Round_691_Div_2/C_Row_GCD.py

@@ -0,0 +1,38 @@
+# from functools import reduce
+# from math import sqrt
+#
+#
+# def factors(num):
+#     step = 2 if num % 2 else 1
+#     return set(reduce(list.__add__, ([i, num // i] for i in range(1, int(sqrt(num)) + 1, step) if num % i == 0)))
+#
+#
+# n, m = map(int, input().split())
+# a_list = list(map(int, input().split()))
+# b_list = list(map(int, input().split()))
+# answer = []
+# for l in range(m):
+#     numbers = [b_list[l]] * n
+#     for j in range(n):
+#         numbers[j] += a_list[j]
+#     minim = min(numbers)
+#     remanders = 0
+#     for k in range(n):
+#         remanders += numbers[k] % minim
+#     if remanders == 0:
+#         answer.append(minim)
+#     else:
+#         fac = list(factors(minim))
+#         fac.sort(reverse=True)
+#         i = 1
+#         while True:
+#             minim = fac[i]
+#             remanders = 0
+#             for k in range(n):
+#                 remanders += numbers[k] % fac[i]
+#             if remanders == 0:
+#                 answer.append(minim)
+#                 break
+#             else:
+#                 i += 1
+# print(*answer)

2020/2020-12-28_Educational_Codeforces_Round_101_Div_2/A_Regular_Bracket_Sequence.py

@@ -0,0 +1,17 @@
+T = int(input())
+for tc in range(T):
+    seq = list(input())
+    # print(seq)
+    dim = len(seq)
+    if seq[0] == ")" or seq[dim - 1] == "(" or len(seq) % 2 == 1:
+        print("NO")
+    else:
+        indop = seq.index("(")
+        indcl = seq.index("(")
+        before = indop
+        middle = indcl - indop - 1
+        after = dim - 1 - indcl
+        if (before + after + middle) % 2 == 0:
+            print("YES")
+        else:
+            print("NO")

2020/2020-12-28_Educational_Codeforces_Round_101_Div_2/B_Red_and_Blue.py

@@ -0,0 +1,28 @@
+# import numpy as np
+#
+# T = int(input())
+# for tc in range(T):
+#     n = int(input())
+#     reds = list(map(int, input().split()))
+#     m = int(input())
+#     blues = list(map(int, input().split()))
+#     i = 0
+#     j = 0
+#     maxim = 0
+#     summat[0][0] = max(reds[0], blues[0])
+#     summat = np.zeros((n, m), dtype=int)
+#     while i < n and j < m:
+#         if j == 0:
+#             summat[i][j] = reds[i]
+#         elif i == 0:
+#             summat[i][j] = blues[j]
+#         else:
+#             if reds[i] > blues[j]:
+#                 summat[i][j] = summat[i - 1][j] + reds[i]
+#                 i += 1
+#             else:
+#                 summat[i][j] = summat[i][j - 1] + blues[j]
+#                 j += 1
+#         print(summat)
+#     print(summat)
+#     print(maxim)

2020/2020-12-28_Educational_Codeforces_Round_101_Div_2/Template_CodeForces_Python.py

@@ -0,0 +1,5 @@
+T = int(input())
+for tc in range(T):
+    N = int(input())
+    A, B = map(int, input().split())
+    f_list = list(map(int, input().split()))

2020/2020-12-30_Good_Bye_2020/A_Bovine_Dilemma.py

@@ -0,0 +1,9 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    x_coord = list(map(int, input().split()))
+    diffs = set()
+    for i in range(n):
+        for j in range(i + 1, n):
+            diffs.add(x_coord[j] - x_coord[i])
+    print(len(diffs))

2020/2020-12-30_Good_Bye_2020/B_Last_minute_enhancements.py

@@ -0,0 +1,11 @@
+T = int(input())
+for tc in range(T):
+    n = int(input())
+    seq = list(map(int, input().split()))
+    elements = set()
+    for num in seq:
+        if num not in elements:
+            elements.add(num)
+        else:
+            elements.add(num + 1)
+    print(len(elements))