KarthikMAM

html {
  box-sizing: border-box;
}

*, *:after, *:before {
  box-sizing: inherit;
}

KarthikMAM

Bash CheatSheet

Delete Merged Git Branches

git branch -vv | grep gone | awk '{print $1}' | tr "\n" " " | xargs git branch -d

Get Changed Files List

KarthikMAM

from functools import reduce

for _ in range(int(input())):
    input()
    print(reduce(lambda x, y: x ^ y, list(map(int, input().split()))))

KarthikMAM

m = {
  '0': '_',
  '1': '0',
  '2': '1',
  '3': '2',
  '4': '3',
  '5': '4',
  '6': '5',
  '7': '6',
  '8': '7',

KarthikMAM

#preparing for download 
mkdir "gridcorpus"
cd "gridcorpus"
mkdir "raw" "audio" "video"
cd "raw" && mkdir "audio" "video"

for i in `seq $1 $2`
do
    printf "\n\n------------------------- Downloading $i th speaker -------------------------\n\n"
    

KarthikMAM

__author__ = "Karthik M A M"

#get the user input
x = [ input().split() for i in range(int(input().split()[0])) ]
c = int(input())
n, m = len(x), len(x[0])

#iterate over each ring
for l in range(min(n, m) // 2):
    temp = x[l + 1: n - l - 1]

KarthikMAM

#This algorithm will find the prime numbers
#faster than conventional methods
#by checking only the prime number divisiblity
prime = [2]
for i in range(2, int(input())):
    l = int(i ** 0.5) + 1
    for j in prime:
        if j > l:
            prime.append(i)
            break

KarthikMAM

n = int(input()) + 1
x = { i for i in range(2, n) for j in range(2, int(i ** 0.5 + 1)) if i % j == 0 }
print([ i for i in range(2, n) if i not in x ])

KarthikMAM

#precedance and the operation of each binary operator
prec = { "**": 3,
         "*": 2,
         "/": 2,
         '%': 2,
         "+": 1,
         "-": 1,
         "$": 0}
operFunc = {'+': lambda a, b: a + b,
            '-': lambda a, b: a - b,