Merge pull request #49 from imtiazpy/update-version

Upated python code version and modified solutions under BuiltIns subd…

Author: arsho

BuiltIns/AnyorAll.py

@@ -3,19 +3,11 @@
 Subdomain : Built-Ins
 Domain    : Python
 Author    : Ahmedur Rahman Shovon
+Updater   : Imtiaz Ahmed
 Created   : 15 July 2016
+Updated   : 29 August 2022
 Problem   : https://www.hackerrank.com/challenges/any-or-all/problem
 '''
-n = int(input())
-ar = list(map(int,input().split()))
-ar = sorted(ar)
-if(ar[0]<=0):
-    print(False)
-else:
-    chk = False
-    for i in ar:
-        s = str(i)
-        if (s==s[::-1]):
-            chk = True
-            break
-    print(chk)
+n = input()
+ar = input().split()
+print(all([int(i)>0 for i in ar]) and any([i==i[::-1] for i in ar]))

BuiltIns/AthleteSort.py

@@ -3,21 +3,21 @@
 Subdomain : Built-Ins
 Domain    : Python
 Author    : Atharva Shah
+Updater   : Imtiaz Ahmed
 Created   : 3 April 2021
+Updated   : 30 August 2022
 Problem   : https://www.hackerrank.com/challenges/python-sort-sort/problem
 '''
 
-import sys
+if __name__ == '__main__':
+    n, m = map(int, input().split())
 
-if __name__ == "__main__":
-    n, m = input().strip().split(' ')
-    n, m = [int(n), int(m)]
     arr = []
-    for arr_i in range(n):
-       arr_t = [int(arr_temp) for arr_temp in input().strip().split(' ')]
-       arr.append(arr_t)
-    k = int(input().strip())
+
+    for _ in range(n):
+        arr.append(list(map(int, input().rstrip().split())))
+        
+    k = int(input())
 
-    sorted_arr = sorted(arr, key = lambda x : x[k])
-    for row in sorted_arr:
-        print(' '.join(str(y) for y in row))
+    for i in sorted(arr, key= lambda x: x[k]):
+        print(*i)

BuiltIns/Zipped.py

@@ -3,14 +3,15 @@
 Subdomain : Built-Ins
 Domain    : Python
 Author    : Ahmedur Rahman Shovon
+Updater   : Imtiaz Ahmed
 Created   : 15 July 2016
+Updated   : 30 August 2022
 Problem   : https://www.hackerrank.com/challenges/zipped/problem
 '''
-n, x = map(int,input().split())
-ar = [0 for i in range(n)]
-for i in range(x):
-    temp_ar=list(map(float,input().split()))
-    for j in range(n):
-        ar[j] += temp_ar[j]
-for i in range(n):
-    print(ar[i]/x)
+
+N, X = map(int, input().split())
+scores = []
+for _ in range(X):
+    scores.append(list(map(float, input().split())))
+for i in zip(*scores):
+    print(sum(i)/len(i))

BuiltIns/ginortS.py

@@ -3,9 +3,11 @@
 Subdomain : Built-Ins
 Domain    : Python
 Author    : Ahmedur Rahman Shovon
+Updater   : Imtiaz Ahmed
 Created   : 15 July 2016
+Updated   : 29 August 2022
 Problem   : https://www.hackerrank.com/challenges/ginorts/problem
 '''
+
 s = input()
-s = sorted(s,key = lambda x:(x.isdigit() and int(x)%2==0, x.isdigit(),x.isupper(),x.islower(),x))
-print(*(s),sep = '')
+print(''.join(sorted(s, key=lambda x: (x.isdigit() and int(x)%2==0, x.isdigit(), x.isupper(), x.islower(), x))))

Classes/Class2FindtheTorsionalAngle.py

@@ -1,3 +1,6 @@
+import math
+
+
 '''
 Title     : Class 2 - Find the Torsional Angle
 Subdomain : Classes
@@ -6,52 +9,37 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/class-2-find-the-torsional-angle/problem
 '''
-# Enter your code here. Read input from STDIN. Print output to STDOUT
-
-import math
-def custom_diff(a,b):
-    res0 = a[0] - b[0]
-    res1 = a[1] - b[1]
-    res2 = a[2] - b[2]
-    return [res0,res1,res2]
-
-def dot_product(a,b):
-    return a[0]*b[0]+a[1]*b[1]+a[2]*b[2]
-
-def abs_val(a):
-    tmp_val=a[0]*a[0]+a[1]*a[1]+a[2]*a[2]
-    return math.sqrt(tmp_val)
-
-
 
-def cross(a, b):
-    c = [a[1]*b[2] - a[2]*b[1],
-         a[2]*b[0] - a[0]*b[2],
-         a[0]*b[1] - a[1]*b[0]]
+class Points:
+    def __init__(self, x, y, z):
+        self.x = x
+        self.y = y
+        self.z = z
 
-    return c
+    def __sub__(self, other):
+        return Points(self.x - other.x, self.y - other.y, self.z - other.z)
 
-a_str_ar=raw_input().strip().split()
-b_str_ar=raw_input().strip().split()
-c_str_ar=raw_input().strip().split()
-d_str_ar=raw_input().strip().split()
+    def dot(self, other):
+        return self.x * other.x + self.y * other.y + self.z * other.z  
+        
+    def absolute(self):
+        return math.sqrt(self.x * self.x + self.y * self.y + self.z * self.z)
 
-a=list(map(float,a_str_ar))
-b=list(map(float,b_str_ar))
-c=list(map(float,c_str_ar))
-d=list(map(float,d_str_ar))
+    def cross(self, other):
+        return Points(self.y * other.z - self.z * other.y,
+            self.z * other.x - self.x * other.z,
+            self.x * other.y - self.y * other.x)
 
-ab=custom_diff(b,a)
-bc=custom_diff(c,b)
-cd=custom_diff(d,c)
 
-x=cross(ab,bc)
-y=cross(bc,cd)
-       
-cosphi_top=dot_product(x,y)
-cosphi_bottom=abs_val(x)*abs_val(y)
-cosphi=cosphi_top/cosphi_bottom
+if __name__ == '__main__':
+    points = list()
+    for i in range(4):
+        a = list(map(float, input().split()))
+        points.append(a)
 
-res=math.degrees(math.acos(cosphi))
+    a, b, c, d = Points(*points[0]), Points(*points[1]), Points(*points[2]), Points(*points[3])
+    x = (b - a).cross(c - b)
+    y = (c - b).cross(d - c)
+    angle = math.acos(x.dot(y) / (x.absolute() * y.absolute()))
 
-print "%.2f" %res
+    print("%.2f" % math.degrees(angle))