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