first commit

Author: piyushsohal-unisys

EvenOddQuery/EvenOddQuery.py

@@ -0,0 +1,26 @@
+# https://www.hackerrank.com/challenges/even-odd-query/problem
+
+n = int(input())
+a = list(map(int, input().split()))
+q = int(input())
+
+def check(x):
+    if (x + 1) < n:
+        if a[x + 1] == 0:
+            return True
+    return False
+
+
+for i in range(q):
+    x, y = map(int, input().split())
+    x = x - 1
+    result = ""
+    if x > y:
+        result = "Odd"
+    elif check(x) and (y - x) != 1:
+        result = "Odd"
+    elif a[x] % 10 in [0, 2, 4, 6, 8]:
+        result = "Even"
+    elif a[x] % 10 in [1, 3, 5, 7, 9]:
+        result = "Odd"
+    print(result)

EvenOddQuery/__init__.py

@@ -0,0 +1,13 @@
+10
+9 7 3 6 1 2 9 3 1 9
+10
+5 8
+5 9
+1 6
+4 7
+1 2
+4 7
+1 3
+2 7
+6 6
+5 8

EvenOddQuery/input.txt

@@ -0,0 +1,13 @@
+
+
+
+Odd
+Odd
+Odd
+Even
+Odd
+Even
+Odd
+Odd
+Even
+Odd

EvenOddQuery/output.txt

@@ -0,0 +1,8 @@
+t = int(raw_input())
+while t > 0:
+    n, k = map(int, raw_input().split())
+    t = t - 1
+    l = list(map(int, raw_input().split()))
+    for i in range(len(l) - k + 1):
+        print max(l[i:i + k]),
+    print "\n"

Maximum_of_all_subarrays_of_size_k

@@ -0,0 +1,40 @@
+# code
+class Tree(object):
+    def __init__(self):
+        self.left = None
+        self.right = None
+        self.data = None
+
+
+def create_tree(root, n):
+    print(n)
+    root = Tree()
+    root.right = Tree()
+    root.left = Tree()
+    if n > 0:
+        create_tree(root.right, n - 1)
+        create_tree(root.left, n - 1)
+    return root
+
+
+def create_list(tempList, count):
+    outList = []
+    for i in range(count):
+        outList.append(tempList[i] + tempList[i + 1])
+    outList.reverse()
+    return outList
+
+
+def mainFN():
+    T = int(input())
+    for i in range(T):
+        n = int(input())
+        inputList = list(map(int, input().split()))
+        for j in range(n - 1):
+            tempList = create_list(inputList, n - j - 1)
+            for k in tempList:
+                inputList.insert(0, k)
+        print(*inputList)
+
+
+mainFN()

__init__.py

@@ -0,0 +1,8 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        m1 = list(map(int, input().split()))
+        m2 = list(map(int, input().split()))
+        m3 = [x + y for x, y in zip(m1, m2)]
+        print(*m3)

add_matrix.py

@@ -0,0 +1,13 @@
+if __name__ == '__main__':
+    t = int(input())
+    while t:
+        n = int(input())
+        input_list = list(map(int, input().split()))
+        x = int(input())
+        try:
+            print(input_list.index(x), end=' ')
+            input_list.reverse()
+            print(n - input_list.index(x) - 1, end='\n')
+        except ValueError as ex:
+            print('-1')
+        t -= 1

first_and_last_x.py

@@ -0,0 +1,12 @@
+import time
+
+if __name__ == '__main__':
+    start_time = time.time()
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        temp = 1
+        for j in range(n):
+            print(*range(temp, temp + j + 1))
+            temp += j + 1
+    print("\n", time.time() - start_time)

folyd_triangle.py

@@ -0,0 +1,14 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        a, b = map(int, input().split())
+        if a % b == 0:
+            print(b)
+        else:
+            gcd = min(a, b)
+            while gcd > 0:
+                if a % gcd == 0 and b % gcd == 0:
+                    break
+                else:
+                    gcd -= 1;
+            print(gcd)

gcd.py

@@ -0,0 +1,11 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n, k = map(int, input().split())
+        input_list = list(map(int, input().split()))
+        output_list = []
+        while k:
+            output_list.append(max(input_list))
+            input_list.remove(max(input_list))
+            k -= 1
+        print(*output_list)

k_largest_num.py

@@ -0,0 +1,17 @@
+# code
+def maxSum(arr, size):
+    incl = 0
+    excl = 0
+    for i in range(0, size):
+        new_excl = (incl if incl > excl else excl)
+        incl = excl + arr[i]
+        excl = new_excl
+        print(new_excl, incl, excl)
+    print(incl if incl > excl else excl)
+
+
+t = int(input())
+for i in range(0, t):
+    size = int(input())
+    arr = list(map(int, input().split()))
+    maxSum(arr, size)

max_sum_woadj.py

@@ -0,0 +1,6 @@
+if __name__ == '__main__':
+    t = int(input())
+    while t:
+        input_str = input()
+        n = int(input())
+        

minimize_string_array.py

@@ -0,0 +1,7 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        m1 = list(map(int, input().split()))
+        ap_sum = (n * (n + 1)) / 2
+        print(int(ap_sum) - sum(m1))

missing_num_array.py

@@ -0,0 +1,12 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        m1 = list(map(int, input().split()))
+        m2 = []
+        for x in m1:
+            if x in m2:
+                m2.remove(x)
+            else:
+                m2.append(x)
+        print(*m2)

odd_one_out.py

@@ -0,0 +1,19 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        m1 = list(map(int, input().split()))
+        m2 = []
+        m2.append(min(m1))
+        minnum = min(m1)
+        m1.remove(minnum)
+        while len(m1) > 0:
+            minnum = min(m1)
+            m2.append(minnum)
+            m1.remove(minnum)
+            if len(m1) == 0:
+                break
+            minnum = min(m1)
+            m2.insert(0, minnum)
+            m1.remove(minnum)
+        print(*m2)

pendulum_array.py

@@ -0,0 +1,19 @@
+def permute(a, l, r):
+    if l == r:
+        results.append(''.join(a))
+    else:
+        for i in range(l, r + 1):
+            a[l], a[i] = a[i], a[l]
+            permute(a, l + 1, r)
+            a[l], a[i] = a[i], a[l]
+
+
+if __name__ == '__main__':
+    t = int(input())
+    while t:
+        input_str = input()
+        results = []
+        permute(list(input_str), 0, len(input_str) - 1)
+        results.sort()
+        print(*results)
+        t -= 1

permute_string.py

@@ -0,0 +1,10 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        input_list = list(map(int, input().split()))
+        for j in range(n):
+            input_list[j] += (input_list[input_list[j]]%n)*n
+        for j in range(n):
+            input_list[j] //= n
+        print(*input_list)

rearrange_arr.py

@@ -0,0 +1,6 @@
+if __name__ == '__main__':
+    t = int(input())
+    while t:
+        input_str = input()
+        print(input_str.replace(' ', ''))
+        t -= 1

remove_spaces.py

@@ -0,0 +1,8 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        input_list = list(map(int, input().split()))
+        for j in range(n - 1):
+            input_list[0], input_list[j + 1] = input_list[j + 1], input_list[0]
+        print(input_list)

rotate_array.py

@@ -0,0 +1,24 @@
+# if __name__ == '__main__':
+#     t = int(input())
+#     for i in range(t):
+#         n, d = map(int, input().split())
+#         input_list = list(map(int, input().split()))
+#         while d:
+#             for j in reversed(range(n - 1)):
+#                 input_list[0], input_list[j + 1] = input_list[j + 1], input_list[0]
+#             d -= 1
+#         print(*input_list)
+
+# -------------------------OR-------------------------------------------
+if __name__ == '__main__':
+    t = int(input())
+    while t:
+        n, d = map(int, input().split())
+        input_list = list(map(int, input().split()))
+        output_list = []
+        for i in range(d, n):
+            output_list.append(input_list[i])
+        for i in range(d):
+            output_list.append(input_list[i])
+        print(*output_list)
+        t -= 1

rotate_array_by_n.py

@@ -0,0 +1,18 @@
+def check_list(temp):
+    for x in temp:
+        if x != 0:
+            return False
+    return True
+
+
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        m1 = list(map(int, input().split()))
+        m2 = list(map(int, input().split()))
+        m3 = [x - y for x, y in zip(m1, m2)]
+        if check_list(m3):
+            print("Yes")
+        else:
+            print("No")

same_matrix.py

@@ -0,0 +1,10 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        input_list = list(map(int, input().split()))
+        for j in range(len(input_list)):
+            if input_list[j] == 0:
+                input_list.pop(j)
+                input_list.insert(0, 0)
+        print(*input_list)

seg_01.py

@@ -0,0 +1,13 @@
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        actual_time = input()
+        actual_time_list = list(actual_time)
+        if actual_time[8:] == 'AM':
+            if int(actual_time[:2]) == 12:
+                actual_time_list[:2] = '00'
+        else:
+            if actual_time[:2] != '12':
+                actual_time_list[:2] = str(int(actual_time[:2]) + 12)
+        actual_time = ''.join(actual_time_list)
+        print(actual_time[:8])

to_military.py

@@ -0,0 +1,17 @@
+import re
+
+t = int(input())
+
+for i in range(0, t):
+    size = int(input())
+    totalSize = size * size
+    m1 = list(map(int, re.sub(' +', ' ', input()).split(' ')))
+    print(m1)
+    m3 = [0] * totalSize
+    temp = 0
+    for i in range(0, totalSize):
+        if temp > totalSize - 1:
+            temp = temp - totalSize + 1
+        m3[temp] = m1[i]
+        temp += size
+    print(' '.join([str(x) for x in m3]))

transpose_matrix.py

@@ -0,0 +1,27 @@
+def SieveOfEratosthenes(n):
+    # Create a boolean array "prime[0..n]" and initialize
+    #  all entries it as true. A value in prime[i] will
+    # finally be false if i is Not a prime, else true.
+    prime = [True for i in range(n + 1)]
+    p = 2
+    while p * p <= n:
+
+        # If prime[p] is not changed, then it is a prime
+        if prime[p]:
+
+            # Update all multiples of p
+            for i in range(p * 2, n + 1, p):
+                prime[i] = False
+        p += 1
+    return prime
+
+
+if __name__ == '__main__':
+    t = int(input())
+    for i in range(t):
+        n = int(input())
+        prime_n = SieveOfEratosthenes(n)
+        for j in range(2, n):
+            if prime_n[j] and prime_n[n - j]:
+                print(j, n - j)
+                break