Skip to content

Commit 06bcab0

Browse files
piyushsohal-unisyspiyushsohal-unisys
committed
first commit
0 parents  commit 06bcab0

26 files changed

+371
-0
lines changed

Diff for: ‎EvenOddQuery/EvenOddQuery.py

+26
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
# https://www.hackerrank.com/challenges/even-odd-query/problem
2+
3+
n = int(input())
4+
a = list(map(int, input().split()))
5+
q = int(input())
6+
7+
def check(x):
8+
if (x + 1) < n:
9+
if a[x + 1] == 0:
10+
return True
11+
return False
12+
13+
14+
for i in range(q):
15+
x, y = map(int, input().split())
16+
x = x - 1
17+
result = ""
18+
if x > y:
19+
result = "Odd"
20+
elif check(x) and (y - x) != 1:
21+
result = "Odd"
22+
elif a[x] % 10 in [0, 2, 4, 6, 8]:
23+
result = "Even"
24+
elif a[x] % 10 in [1, 3, 5, 7, 9]:
25+
result = "Odd"
26+
print(result)

Diff for: ‎EvenOddQuery/__init__.py

Whitespace-only changes.

Diff for: ‎EvenOddQuery/input.txt

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
10
2+
9 7 3 6 1 2 9 3 1 9
3+
10
4+
5 8
5+
5 9
6+
1 6
7+
4 7
8+
1 2
9+
4 7
10+
1 3
11+
2 7
12+
6 6
13+
5 8

Diff for: ‎EvenOddQuery/output.txt

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
2+
3+
4+
Odd
5+
Odd
6+
Odd
7+
Even
8+
Odd
9+
Even
10+
Odd
11+
Odd
12+
Even
13+
Odd

Diff for: ‎Maximum_of_all_subarrays_of_size_k

+8
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
t = int(raw_input())
2+
while t > 0:
3+
n, k = map(int, raw_input().split())
4+
t = t - 1
5+
l = list(map(int, raw_input().split()))
6+
for i in range(len(l) - k + 1):
7+
print max(l[i:i + k]),
8+
print "\n"

Diff for: ‎__init__.py

+40
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
# code
2+
class Tree(object):
3+
def __init__(self):
4+
self.left = None
5+
self.right = None
6+
self.data = None
7+
8+
9+
def create_tree(root, n):
10+
print(n)
11+
root = Tree()
12+
root.right = Tree()
13+
root.left = Tree()
14+
if n > 0:
15+
create_tree(root.right, n - 1)
16+
create_tree(root.left, n - 1)
17+
return root
18+
19+
20+
def create_list(tempList, count):
21+
outList = []
22+
for i in range(count):
23+
outList.append(tempList[i] + tempList[i + 1])
24+
outList.reverse()
25+
return outList
26+
27+
28+
def mainFN():
29+
T = int(input())
30+
for i in range(T):
31+
n = int(input())
32+
inputList = list(map(int, input().split()))
33+
for j in range(n - 1):
34+
tempList = create_list(inputList, n - j - 1)
35+
for k in tempList:
36+
inputList.insert(0, k)
37+
print(*inputList)
38+
39+
40+
mainFN()

Diff for: ‎add_matrix.py

+8
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
m1 = list(map(int, input().split()))
6+
m2 = list(map(int, input().split()))
7+
m3 = [x + y for x, y in zip(m1, m2)]
8+
print(*m3)

Diff for: ‎first_and_last_x.py

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
while t:
4+
n = int(input())
5+
input_list = list(map(int, input().split()))
6+
x = int(input())
7+
try:
8+
print(input_list.index(x), end=' ')
9+
input_list.reverse()
10+
print(n - input_list.index(x) - 1, end='\n')
11+
except ValueError as ex:
12+
print('-1')
13+
t -= 1

Diff for: ‎folyd_triangle.py

+12
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
import time
2+
3+
if __name__ == '__main__':
4+
start_time = time.time()
5+
t = int(input())
6+
for i in range(t):
7+
n = int(input())
8+
temp = 1
9+
for j in range(n):
10+
print(*range(temp, temp + j + 1))
11+
temp += j + 1
12+
print("\n", time.time() - start_time)

Diff for: ‎gcd.py

+14
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
a, b = map(int, input().split())
5+
if a % b == 0:
6+
print(b)
7+
else:
8+
gcd = min(a, b)
9+
while gcd > 0:
10+
if a % gcd == 0 and b % gcd == 0:
11+
break
12+
else:
13+
gcd -= 1;
14+
print(gcd)

Diff for: ‎k_largest_num.py

+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n, k = map(int, input().split())
5+
input_list = list(map(int, input().split()))
6+
output_list = []
7+
while k:
8+
output_list.append(max(input_list))
9+
input_list.remove(max(input_list))
10+
k -= 1
11+
print(*output_list)

Diff for: ‎max_sum_woadj.py

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
# code
2+
def maxSum(arr, size):
3+
incl = 0
4+
excl = 0
5+
for i in range(0, size):
6+
new_excl = (incl if incl > excl else excl)
7+
incl = excl + arr[i]
8+
excl = new_excl
9+
print(new_excl, incl, excl)
10+
print(incl if incl > excl else excl)
11+
12+
13+
t = int(input())
14+
for i in range(0, t):
15+
size = int(input())
16+
arr = list(map(int, input().split()))
17+
maxSum(arr, size)

Diff for: ‎minimize_string_array.py

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
while t:
4+
input_str = input()
5+
n = int(input())
6+

Diff for: ‎missing_num_array.py

+7
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
m1 = list(map(int, input().split()))
6+
ap_sum = (n * (n + 1)) / 2
7+
print(int(ap_sum) - sum(m1))

Diff for: ‎odd_one_out.py

+12
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
m1 = list(map(int, input().split()))
6+
m2 = []
7+
for x in m1:
8+
if x in m2:
9+
m2.remove(x)
10+
else:
11+
m2.append(x)
12+
print(*m2)

Diff for: ‎pendulum_array.py

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
m1 = list(map(int, input().split()))
6+
m2 = []
7+
m2.append(min(m1))
8+
minnum = min(m1)
9+
m1.remove(minnum)
10+
while len(m1) > 0:
11+
minnum = min(m1)
12+
m2.append(minnum)
13+
m1.remove(minnum)
14+
if len(m1) == 0:
15+
break
16+
minnum = min(m1)
17+
m2.insert(0, minnum)
18+
m1.remove(minnum)
19+
print(*m2)

Diff for: ‎permute_string.py

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
def permute(a, l, r):
2+
if l == r:
3+
results.append(''.join(a))
4+
else:
5+
for i in range(l, r + 1):
6+
a[l], a[i] = a[i], a[l]
7+
permute(a, l + 1, r)
8+
a[l], a[i] = a[i], a[l]
9+
10+
11+
if __name__ == '__main__':
12+
t = int(input())
13+
while t:
14+
input_str = input()
15+
results = []
16+
permute(list(input_str), 0, len(input_str) - 1)
17+
results.sort()
18+
print(*results)
19+
t -= 1

Diff for: ‎rearrange_arr.py

+10
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
input_list = list(map(int, input().split()))
6+
for j in range(n):
7+
input_list[j] += (input_list[input_list[j]]%n)*n
8+
for j in range(n):
9+
input_list[j] //= n
10+
print(*input_list)

Diff for: ‎remove_spaces.py

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
while t:
4+
input_str = input()
5+
print(input_str.replace(' ', ''))
6+
t -= 1

Diff for: ‎rotate_array.py

+8
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
input_list = list(map(int, input().split()))
6+
for j in range(n - 1):
7+
input_list[0], input_list[j + 1] = input_list[j + 1], input_list[0]
8+
print(input_list)

Diff for: ‎rotate_array_by_n.py

+24
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# if __name__ == '__main__':
2+
# t = int(input())
3+
# for i in range(t):
4+
# n, d = map(int, input().split())
5+
# input_list = list(map(int, input().split()))
6+
# while d:
7+
# for j in reversed(range(n - 1)):
8+
# input_list[0], input_list[j + 1] = input_list[j + 1], input_list[0]
9+
# d -= 1
10+
# print(*input_list)
11+
12+
# -------------------------OR-------------------------------------------
13+
if __name__ == '__main__':
14+
t = int(input())
15+
while t:
16+
n, d = map(int, input().split())
17+
input_list = list(map(int, input().split()))
18+
output_list = []
19+
for i in range(d, n):
20+
output_list.append(input_list[i])
21+
for i in range(d):
22+
output_list.append(input_list[i])
23+
print(*output_list)
24+
t -= 1

Diff for: ‎same_matrix.py

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
def check_list(temp):
2+
for x in temp:
3+
if x != 0:
4+
return False
5+
return True
6+
7+
8+
if __name__ == '__main__':
9+
t = int(input())
10+
for i in range(t):
11+
n = int(input())
12+
m1 = list(map(int, input().split()))
13+
m2 = list(map(int, input().split()))
14+
m3 = [x - y for x, y in zip(m1, m2)]
15+
if check_list(m3):
16+
print("Yes")
17+
else:
18+
print("No")

Diff for: ‎seg_01.py

+10
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
n = int(input())
5+
input_list = list(map(int, input().split()))
6+
for j in range(len(input_list)):
7+
if input_list[j] == 0:
8+
input_list.pop(j)
9+
input_list.insert(0, 0)
10+
print(*input_list)

Diff for: ‎to_military.py

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
if __name__ == '__main__':
2+
t = int(input())
3+
for i in range(t):
4+
actual_time = input()
5+
actual_time_list = list(actual_time)
6+
if actual_time[8:] == 'AM':
7+
if int(actual_time[:2]) == 12:
8+
actual_time_list[:2] = '00'
9+
else:
10+
if actual_time[:2] != '12':
11+
actual_time_list[:2] = str(int(actual_time[:2]) + 12)
12+
actual_time = ''.join(actual_time_list)
13+
print(actual_time[:8])

Diff for: ‎transpose_matrix.py

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
import re
2+
3+
t = int(input())
4+
5+
for i in range(0, t):
6+
size = int(input())
7+
totalSize = size * size
8+
m1 = list(map(int, re.sub(' +', ' ', input()).split(' ')))
9+
print(m1)
10+
m3 = [0] * totalSize
11+
temp = 0
12+
for i in range(0, totalSize):
13+
if temp > totalSize - 1:
14+
temp = temp - totalSize + 1
15+
m3[temp] = m1[i]
16+
temp += size
17+
print(' '.join([str(x) for x in m3]))

Diff for: ‎two_prime_sum.py

+27
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
def SieveOfEratosthenes(n):
2+
# Create a boolean array "prime[0..n]" and initialize
3+
# all entries it as true. A value in prime[i] will
4+
# finally be false if i is Not a prime, else true.
5+
prime = [True for i in range(n + 1)]
6+
p = 2
7+
while p * p <= n:
8+
9+
# If prime[p] is not changed, then it is a prime
10+
if prime[p]:
11+
12+
# Update all multiples of p
13+
for i in range(p * 2, n + 1, p):
14+
prime[i] = False
15+
p += 1
16+
return prime
17+
18+
19+
if __name__ == '__main__':
20+
t = int(input())
21+
for i in range(t):
22+
n = int(input())
23+
prime_n = SieveOfEratosthenes(n)
24+
for j in range(2, n):
25+
if prime_n[j] and prime_n[n - j]:
26+
print(j, n - j)
27+
break

0 commit comments

Comments
 (0)