Hari Vignesh B A December Of Algorithms

December 01/C_HariVignesh18_Cricmetrics.c

@@ -0,0 +1,20 @@
+#include<stdio.h>
+int main(){
+    int n,s,a[100];
+    int max;
+    int i;
+    scanf("%d",&n);
+    for(i = 0;i < n;i++){
+        scanf("%d",&a[i]);
+        s = s + a[i];
+    }
+    max = a[0];
+    int ind = 0;
+    for(i = 1;i<n;i++){
+        if(a[i]>max){
+            max = a[i];
+            ind = i;
+        }
+    }
+    printf("%d\n%d",s,ind);
+}

December 02 /python3_HariVignesh18_Shopper's Choice.py

@@ -0,0 +1,13 @@
+a = list(map(int,input().split()))
+b = []
+for i in a:
+    if i not in b:
+        b.append(i)
+c = []
+for i in b:
+    count = 0
+    for j in a:
+        if i == j:
+            count += 1
+    c.append(count)
+print(c)

December 03/C_HariVignesh18_Sunburnt.c

@@ -0,0 +1,23 @@
+#include <stdio.h>
+int main()
+{
+    int n,a[100];
+    scanf("%d",&n);
+    for(int i = 0;i < n; i++){
+        scanf("%d",&a[i]);
+    }
+    int b = 0;
+    for(int i = 0;i < n; i++){
+        int s = 0;
+        for(int j = 0;j < i;j++){
+            if(a[j]>=a[i]){
+                s = 1;
+                break;
+            }
+        }
+        if(s == 0){
+            b+=1;
+        }
+    }
+    printf("%d",b);
+}

December 04/python3_HariVignesh18_Mirror Magic.py

@@ -0,0 +1,12 @@
+a = input()
+b = ""
+for i in range(0,len(a)-1):
+    for j in range(i+2,len(a)+1):
+        sub = a[i:j]
+        if sub == sub[::-1]:
+            if len(b)!= "" or len(b) > len(sub):
+                b = sub
+if b!="":
+    print(b)
+else:
+    print("Error")

December 05/python3_HariVignesh18_PeakyBlinders.py

@@ -0,0 +1,12 @@
+a = [int(i) for i in input().split()]
+c = 0
+s = 0
+for i in a:
+    s += i
+    c += 1
+b = s/c
+s = 0
+for i in a:
+    if i >= b:
+        s += i
+print(s)

December 06/python3_HariVignesh18_TheLostAlgorithmScrolls.py

@@ -0,0 +1,18 @@
+s = input().split()
+ans = []
+for i in range(0,len(s)-1):
+    if len(s[i]) == len(s[i+1]):
+        f = 0
+        a = s[i]
+        b = s[i+1]
+        for i in range(0,len(s[i])):
+            if a[i] != b[i]:
+                f += 1
+        if f == 1:
+            if a not in ans:
+                ans.append(a)
+            ans.append(b)
+if ans != []:
+    print(ans)
+else:
+    print("No Valid Chain.")

December 07/python3_HariVignesh18_BabyBlocks.py

@@ -0,0 +1,13 @@
+def rectangleInCircle(width ,height ,radius):
+    diagSquare = (width**2 + height**2)
+    diagonal = diagSquare**0.5
+    if diagonal > radius*2:
+        return False
+    else:
+        return True
+a = [int(i) for i in input().split()]
+ans = rectangleInCircle(a[0] , a[1], a[2])
+if ans == True:
+    print("True")
+else:
+    print("False")

December 08/python3_HariVignesh18_TheEnchantedForest.py

@@ -0,0 +1,23 @@
+def find_path(n):
+    ans = [[0]*n for _ in range(n)]
+    c = 0
+    i = 0
+    j = n//2
+    for k in range(1,(n*n)+1):
+        ans [i][j] = k
+        i -= 1
+        j += 1
+        c += 1
+        if c == n:
+            i += 2
+            j -= 1
+            c = 0
+        else:
+            if j == n:
+                j -= n
+            elif i < 0:
+                i += n
+    for row in ans:
+        print(*row)
+n = int(input())
+find_path(n)

December 09/python3_HariVignesh18_Camels_In_A_String.py

@@ -0,0 +1,6 @@
+s = input()
+c = 1
+for i in s:
+    if ord(i)>64 and ord(i)<91:
+        c += 1
+print(c)