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)