Divya Dharshan S - A December Of Algorithms 2023 - Submission

December 01/python3_Divyadharshan_Cricmetric.py

@@ -0,0 +1,9 @@
+n = int(input())
+runs = [int(i) for i in input().split()]
+maxi, t_runs = 0, 0
+for k in range(n):
+  if runs[k] > runs[maxi]:
+    maxi = k
+  t_runs += runs[k]
+print(t_runs)
+print(maxi)

December 02 /python3_Divyadharshan_ShoppersChoice.py

@@ -0,0 +1,8 @@
+p = [int(i) for i in input().split()]
+dd = {}
+for i in p:
+  if i not in dd:
+    dd[i] = 1
+  else:
+    dd[i] += 1
+print(list(dd.values()))

December 03/python3_Divyadharshan_Sunburnt.py

@@ -0,0 +1,9 @@
+n=int(input())
+h=[int(i) for i in input().split()]
+s=1
+m=h[0]
+for i in range(1,n):
+    if h[i]>=m:
+        s+=1
+        m=h[i]
+print(s)

December 04/python3_Divyadharshan_MirrorMagic.py

@@ -0,0 +1,12 @@
+s=input().strip()
+p=[]
+for i in range(len(s)):
+     for j in range(i,len(s)):
+          if s[i:j+1]==s[i:j+1][::-1]:
+               if len(s[i:j+1])!=1:
+                    p.append(s[i:j+1])
+p.sort(key=len)
+if p:
+     print(p[0])
+else:
+     print("Error")

December 05/python3_Divyadharshan_PeakyBlinders.py

@@ -0,0 +1,7 @@
+t = [int(i) for i in input().split()]
+ave = sum(t)/len(t)
+s = 0
+for i in t:
+  if i>=ave:
+    s+=i
+print(s)

December 06/python3_Divyadharshan_TheLostAlgorithmScrolls.py

@@ -0,0 +1,21 @@
+w=[i for i in input().split()]
+def comp(w1,w2):
+    c=0
+    for i in range(len(w1)):
+        if w1[i]!=w2[i]:
+            c-=-1
+        if c>1:
+            return False
+    return c==1
+d={}
+f=0
+for i in range(1,len(w)):
+    if len(w[i])==len(w[i-1]):
+        if comp(w[i],w[i-1]):
+            d[w[i-1]]=1
+            d[w[i]]=1
+            f=1
+if f:
+    print(list(d.keys()))
+else:
+    print("No valid chain.")

December 07/python3_Divyadharshan_BabyBlocks.py

@@ -0,0 +1,8 @@
+w,h,r=[int(i) for i in input().split()]
+def rectangleInCircle(w,h,r):
+    d=(w**2+h**2)**0.5
+    if d<=r*2:
+        print("true")
+    else:
+        print("false")
+rectangleInCircle(w,h,r)

December 08/python3_Divyadharshan_TheEnchantedForest.py

@@ -0,0 +1,21 @@
+#Using **Siamese method** also known as the De la Loubère method, a method for constructing magic squares of odd order where row, columns and diagonals have same sum.
+
+def find_path(n):
+    pa = [[0]*n for p in range(n)]
+    i,j=0,n//2
+    for k in range(1,n*n+1):
+        pa[i][j]=k
+        i-=1
+        j-=-1
+        if k%n==0:
+            i-=-2
+            j-=1
+        else:
+            if j==n:
+                j-=n
+            elif i<0:
+                i-=-n
+    for k in pa:
+        print(*k)
+
+find_path(int(input()))

December 09/python3_Divyadharshan_CamelsOnAString.py

@@ -0,0 +1,6 @@
+s=input().strip()
+w=1
+for i in s:
+  if 65<=ord(i)<=90:
+    w+=1
+print(w)

December 10/python3_Divyadharshan_ForgotPassword.py

@@ -0,0 +1,7 @@
+import re
+t=["Shivnash Kumar","Ragul Gupta"]
+query=input().split()
+st=query[1]
+l=[int(k) for k in re.findall('[0-9]+',st)]
+for i in range(len(t)):
+  print(t[i][l[0]-1:l[0]+l[1]-1])

December 11/python3_Divyadharshan_CoderOfConversions.py

@@ -0,0 +1,7 @@
+k,p=[int(i) for i in input().split()]
+k=k+p
+p=""
+while k:
+  p=str(k%2)+p
+  k//=2
+print(p)

December 12/python3_Divyadharshan_TheHeist.py

@@ -0,0 +1,25 @@
+box1=[i for i in input().split()]
+box2=[i for i in input().split()]
+box3=[i for i in input().split()]
+def search(k):
+  l=0
+  h=len(k)-1
+  while l<=h:
+    m=(l+h)//2
+    if k[m]=="Gold":
+      return 1
+    else:
+      if k[m]<"Gold":
+        l=m+1
+      else:
+        h=m-1
+  return 0
+box1.sort()
+box2.sort()
+box3.sort()
+if search(box1):
+    print("Box1 Contains the Gold")
+elif search(box2):
+    print("Box2 Contains the Gold")
+elif search(box3):
+    print("Box3 Contains the Gold")

December 13/python3_Divyadharshan_CallCipher.py

@@ -0,0 +1,14 @@
+d={"ABC":2,"DEF":3,"GHI":4,"JKL":5,"MNO":6,"PQRS":7,"TUV":8,"WXYZ":9}
+s=input()
+def textToNum(v):
+    s=""
+    for i in v:
+        if 65<=ord(i)<=90:
+            for j in d:
+                if i in j:
+                    s+=str(d[j])
+                    break
+        else:
+            s+=i
+    print(s)
+textToNum(s)