Optimized Problems added

Author: Dhrumil-Zion

infosys_2.py

@@ -15,3 +15,31 @@
     res = reduce(ior, c)
     temp.append(sum(c)/res)
 print(math.floor(max(temp)*10000))
+
+
+import math
+from itertools import combinations
+
+
+# def solution(A):
+#     m = math.floor(0)
+#     i = len(A)
+#     while i >= 0:
+#         subarrayslist = set(combinations(A, i))
+#         for array in subarrayslist:
+#             if array:
+#                 S = sum(array)
+#                 R = array[0]
+#                 for a in range(1, len(array)):
+#                     R = R | array[a]
+#                 beauty = math.floor((S / R)*10000)
+#                 if m < beauty:
+#                     m = beauty
+#         i -= 1
+#     print(m)
+
+
+# A = []
+# for _ in range(int(input())):
+#     A.append(int(input()))
+# solution(A)

infosys_3.py

@@ -1,15 +1,3 @@
-# import itertools
-# n = str(1001)
-# c =0
-# li = []
-# for pair in itertools.combinations([c for c in range(1,9)],2):
-#     # if sum(pair)<=int(n,2):
-#     #     c+=1
-#     # li.append(pair)
-#     print(pair)
-# print(len(li))
-
-
 from itertools import product
 intt = int(input())
 n=input()
@@ -19,3 +7,24 @@
 res = list(product(*temp))
 k = sum(r[0]+r[1]==r[0]^r[1] for r in res)
 print("{}".format(k%((10**9)+7)))
+
+
+
+# from itertools import combinations
+# def solution(N, S):
+#     DecimalofS = int(S, 2)
+#     elements = [i for i in range(1, DecimalofS + 1)]
+#     pairs = set()
+#     for i in elements:
+#         for j in elements:
+#             pairs.add((i, j))
+#     count = 0
+#     for pair in pairs:
+#         if pair[0] + pair[1] == pair[0] ^ pair[1]:
+#             count += 1
+#     print(count)
+
+
+# N = int(input())
+# S = input()
+# solution(N, S)

permute_arry.py

@@ -0,0 +1,29 @@
+import random
+def twoArrays(k, A, B):
+    A.sort()
+    B.sort(reverse=True)
+    if (any(a+b<k for a,b in zip(A,B))):
+        return "NO"
+    else:
+        return "YES"
+
+A =[84 ,2 ,50 ,51 ,19, 58, 12 ,90 ,81 ,68 ,54 ,73 ,81 ,31 ,79 ,85 ,39 ,2]
+B =[53 ,102, 40 ,17 ,33 ,92 ,18 ,79 ,66 ,23 ,84 ,25 ,38 ,43, 27, 55, 8, 19]
+K =94
+
+print(twoArrays(K,A,B))
+
+
+# def twoArrays(k, A, B):
+#     flg2=0
+#     for _ in range(500):
+#         for c in range(len(A)):
+#             if A[c]+B[c]>=k:
+#                 continue
+#             flg2=1
+#             break
+#         if flg2==0:
+#             return "YES"
+#         flg2=0
+#         random.shuffle(A)
+#     return "NO"