Skillrack Solutions VIT 1st October 2016

Program 1- Pangram

def pangram(s):
    f=0
    for i in range(97,123):
        if s.count(chr(i))==0:
            f=1
            break
    return f
s=input()
s=s.lower()
f=pangram(s)
if f==0:
    print("Pangram")
else:
    print("Not pangram")

Program 2- Adam number 

def reverse(a):
    b=0
    while(a>0):
       b=b*10+a%10
       a=a//10
    return b
a=int(input())
if a**2==(reverse(reverse(a)**2)):
          print("Adam number")
else:
          print("Not an Adam number")

Program 3- Automorphic number

n=int(input())
l=len(str(n))
sq=n**2
if n==sq%(10**l):
    print("Automorphic")
else:
    print("Not automorphic")

Program 4- Elizabeth walk

x=int(input())

y=int(input())

z=int(input())

m1=int(input())

m=0

m+=(x/1000)/3*60 + (y/1000)/2*60 + (z/1000)/6*60

m=int(m)

print(str(6+m//60)+" "+str(m%60))

m+=m1

m+=(x/1000)/3*60 + (y/1000)/6*60 + (z/1000)/2*60

m=int(m)

h=6+m//60

m=m%60

print(str(h)+" "+str(m))

Program 5- Isomorphic number

import sys

n=int(input())

a=[]

for i in range(n):

    a.append(int(input()))

if len(str(a[0]))==1 or len(str(a[0]))==2:

    print("No isomorphic")

    sys.exit()

c=[]

for i in range(n):

    a[i]=list(str(a[i]))

for i in range(len(a)):

    c.append({})

    for j in range(len(a[i])):

        c[i].setdefault(a[i][j],[]).append(j)

print(''.join(a[0]))

for i in range(1,len(a)):

    f=0

    for j in c[i].values():

        if j not in c[0].values():

            f=1

            break

    if f==0:

        print(''.join(a[i]))

Try my app on play store and rate it!

App link- https://play.google.com/store/apps/details?id=appinventor.ai_mayanktechnologies09.Translator

 

Skillrack Solutions VIT 19th September 2016

Program 1- Count Words

from pprint import pprint
import re
import sys
a=input()
a=a.lower()
for i in a:
    if i.isdigit():
        sys.exit()
if re.search(r' [?!.,:;]',a):
    print("Invalid input")
    sys.exit()
l=re.findall(r"[\w']+",a)
d={}
for i in l:
    d[i]=l.count(i)

pprint(d)



Program 2- Histogram

import sys
from pprint import pprint
a=input()
a=a.lower()
for i in a:
    if not i.isalpha():
        print("Invalid input")
        sys.exit()
b={}
for i in a:
    b.update({i:a.count(i)})
c={}
for k,v in b.items():
      c.setdefault(v, []).append(k)
for i in c.keys():
    c[i]=sorted(c[i])
pprint(b)

pprint(c)

Program 3- Minimum Distance

import math

n=int(input())

x=[]

y=[]

for i in range(n):

    x.append(int(input()))

    y.append(int(input()))

min=math.inf

for i in range(n-1):

    for j in range(i+1,n):

        dist=math.sqrt((x[i]-x[j])**2+(y[i]-y[j])**2)

        if dist<min:

            min=dist

for i in range(n-1):

    for j in range(i+1,n):

        dist=math.sqrt((x[i]-x[j])**2+(y[i]-y[j])**2)

        if dist==min:

            print((x[i],y[i]))

            print((x[j],y[j]))

            

Program 4- Letter Identification

w1=input().rstrip()

w2=input().rstrip()

w3=input().rstrip()

l1=[]

l2=[]

l3=[]

l4=[]

for i in w1:

    if i in w2 and i in w3:

        if i not in l1:

         l1.append(i)

for i in w1:

    if i in w2 and i not in w3:

        if i not in l2:

         l2.append(i)

for i in w1:

    if i not in w2 and i not in w3:

        if i not in l3:

         l3.append(i)

for i in w1:

    if i not in l4:

        l4.append(i)

for i in w2:

    if i not in l4:

        l4.append(i)

for i in w3:

    if i not in l4:

        l4.append(i)

print(sorted(l1))

print(sorted(l2))

print(sorted(l3))

print(sorted(l4))

Program 5- Rook and Queen

rr1=int(input())

rc1=int(input())

qr1=int(input())

qc1=int(input())

q=[]

r=[]

for i in range(1,9):

    if i!=rc1:

     r.append((rr1,i))

for i in range(1,9):

    if i!=rr1:

     r.append((i,rc1))

for i in range(1,9):

    if i!=qc1:

     q.append((qr1,i))

for i in range(1,9):

    if i!=qr1:

     q.append((i,qc1))

r1=qr1

c1=qc1

while(r1>1 and c1<8):

    q.append((r1-1,c1+1))

    r1-=1

    c1+=1

r1=qr1

c1=qc1

while(r1<8 and c1>1):

    q.append((r1+1,c1-1))

    r1+=1

    c1-=1

r1=qr1

c1=qc1

while(r1<8 and c1<8):

    q.append((r1+1,c1+1))

    r1+=1

    c1+=1

r1=qr1

c1=qc1

while(r1>1 and c1>1):

    q.append((r1-1,c1-1))

    r1-=1

    c1-=1

r=sorted(r)

for i in r:

    if i in q:

        print(i)

Try my app on play store and rate it!

App link- https://play.google.com/store/apps/details?id=appinventor.ai_mayanktechnologies09.Translator

Skillrack Solutions VIT 11th September 2016

Program 1- Arrangement of Plants

n=int(input())

id1=list()

h=list()

for i in range(n):

    id1.append(int(input()))

    h.append(int(input()))

for i in range(n):

    for j in range(n-i-1):

        if(h[j]>h[j+1]):

            temp=h[j]

            h[j]=h[j+1]

            h[j+1]=temp

            temp=id1[j]

            id1[j]=id1[j+1]

            id1[j+1]=temp

for i in range(n):

    print(id1[i])

Program 2- Create List and Search

n=int(input())

l=[]

for j in range(n):

 b=input().rstrip()

 f=0

 for i in range(len(l)):

    if l[i]==b:

        f=1

        break

 if f==0:

    l.append(b)

r=input()

print(l)

if r in l:

    print("Found")

else:

    print("Not found")

    

Program 3-Finding Friends

n=[]

while(1):

    a=input().rstrip()

    if a=="Stop":

        break

    n.append(a)

index=0

for i in range(len(n)):

    if len(n[i])>len(n[index]):

        index=i

print(len(n))

print(n[index])

print(len(n[index]))

     

Program 4- Polynomial Addition

n1=int(input())

l1=[]

for i in range(n1+1):

    l1.append(int(input()))

n2=int(input())

l2=[]

for i in range(n2+1):

    l2.append(int(input()))

if n1<n2:

    while(len(l1)<len(l2)):

        l1.insert(0,0)

elif n1>n2:

    while(len(l2)<len(l1)):

        l2.insert(0,0)

l=[]

for i in range(len(l1)):

    l.append(l1[i]+l2[i])

print(l)

Program 5- Sparse Matrix

import sys

r=int(input())

c=int(input())

if(r<1 or c<1):

    print('Invalid input')

    sys.exit()

c1=0

c2=0

matrix=[]

for i in range(r):

    matrix.append([])

    for j in range(c):

        matrix[i].append(int(input()))

        if matrix[i][j]==0:

            c1+=1

        else:

            c2+=1

if(c1>=c2):

    print("Sparse")

else:

    print("Not sparse") 

Try my app on play store and rate it!

App link- https://play.google.com/store/apps/details?id=appinventor.ai_mayanktechnologies09.Translator

Skillrack Solutions VIT 5th September 2016

Program 1- Password Check

import re
password=input()
f=0
if len(password)<8:
    f=1
else:
    if not password[0].isalpha():
        f=1
    if not(re.search("[0-9]",password)):
        f=1
    if not(re.search("[ !\"#$%&'()*+,-./:;<=>?@[\]^_`{|}~]",password)):
        f=1
if f==1:
    print("Invalid")
else:
    print("Valid")



Program 2- Keyboard Letters


import re
a=input()
f=0
if(re.search("[QWERTYUIOPqwertyuiop]",a[0])):
   for i in a:
     if not (re.search("[QWERTYUIOPqwertyuiop]",i)):
       f=1
elif(re.search("[ASDFGHJKLasdfghjkl]",a[0])):
   for i in a:
     if not (re.search("[ASDFGHJKLasdfghjkl]",i)):
       f=1
elif(re.search("[ZXCVBNMzxcvbnm]",a[0])):
   for i in a:
     if not (re.search("[ZXCVBNMzxcvbnm]",i)):
       f=1
if f==1:
     print("No")
else:
     print("Yes")
 


Program 3- Distinct Letter



a=input()
a=a.upper()
f=0
for i in a:
    if(a.count(i)>1):
        f=1
        break
if(f==1):
    print("bad")
else:

    print("Good")

Program 4- Caesar Cipher

a=input()

a=a.rstrip('\r')

a=list(a)

d=int(input())

c=0

j=0

for i in a:

    j=ord(i)+d

    if j>122:

     a[c]=chr(j-26)

    else:

     a[c]=chr(j)

    c+=1

a=''.join(a)

print(a)

   

Program 5- Time Conversion

a=input()

h=int(a[0:2])

m=int(a[3:5])

s=int(a[6:8])

mer=a[8:10]

if ((h>0 and h<13)and(m>=0 and m<60) and (s>=0 and s<60)and (mer=='AM' or mer=='PM')):

    if mer=='PM':

        if not h==12:

            h=h+12

    else:

        if h==12:

            h=0

    print(str("%02d"%h)+':'+str("%02d"%m)+':'+str("%02d"%s))