5 abbba
5 abbba
12 abcbcabbacba
8 bcabbacb
n=input()
w=input()
def longestPalSubstr(string):
maxLength = 1
k=0
start = 0
length = len(string)
low = 0
high = 0
# One by one consider every character as center point of
# even and length palindromes
for i in range(1, length):
# Find the longest even length palindrome with center
# points as i-1 and i.
low = i - 1
high = i
while low >= 0 and high < length and string[low] == string[high]:
if high - low + 1 > maxLength:
start = low
maxLength = high - low + 1
low -= 1
high += 1
# Find the longest odd length palindrome with center
# point as i
low = i - 1
high = i + 1
while low >= 0 and high < length and string[low] == string[high]:
if high - low + 1 > maxLength:
start = low
maxLength = high - low + 1
low -= 1
high += 1
#print "Longest palindrome substring is:",
k=maxLength
print(k)
print(string[start:start + maxLength])
Thanks
Happy Programming !
Roll Number~Full Name~Grade Point AverageYour output should be sorted by Roll Number. The grade point average should be rounded off to 2 digits after the decimal point. Use the built-in function round().
Courses TRAN~Transfiguration~1~2011-2012~Minerva McGonagall CHAR~Charms~1~2011-2012~Filius Flitwick Students SLY2301~Hannah Abbott SLY2302~Euan Abercrombie SLY2303~Stewart Ackerley SLY2304~Bertram Aubrey SLY2305~Avery SLY2306~Malcolm Baddock SLY2307~Marcus Belby SLY2308~Katie Bell SLY2309~Sirius Orion Black Grades TRAN~1~2011-2012~SLY2301~AB TRAN~1~2011-2012~SLY2302~B TRAN~1~2011-2012~SLY2303~B TRAN~1~2011-2012~SLY2305~A TRAN~1~2011-2012~SLY2306~BC TRAN~1~2011-2012~SLY2308~A TRAN~1~2011-2012~SLY2309~AB CHAR~1~2011-2012~SLY2301~A CHAR~1~2011-2012~SLY2302~BC CHAR~1~2011-2012~SLY2303~B CHAR~1~2011-2012~SLY2305~BC CHAR~1~2011-2012~SLY2306~C CHAR~1~2011-2012~SLY2307~B CHAR~1~2011-2012~SLY2308~AB EndOfInputSample Output
SLY2301~Hannah Abbott~9.5 SLY2302~Euan Abercrombie~7.5 SLY2303~Stewart Ackerley~8.0 SLY2304~Bertram Aubrey~0 SLY2305~Avery~8.5 SLY2306~Malcolm Baddock~6.5 SLY2307~Marcus Belby~8.0 SLY2308~Katie Bell~9.5 SLY2309~Sirius Orion Black~9.0
def gpa(l):
n=len(l)
m=0
M=0
for i in range(0,n):
if l[i]=='A':
m=10
elif l[i]=='AB':
m=9
elif l[i]=='B':
m=8
elif l[i]=='BC':
m=7
elif l[i]=='C':
m=6
elif l[i]=='CD':
m=5
elif l[i]=='D':
m=4
elif l[i]=='E':
return(0)
M += m
#M_round=round(M ,2)
gpa = (M/n)
return(round(gpa,2))
n=None
c=''
s=''
g=''
gl=''
while(n!='EndOfInput'):
n=input()
c += n +'\n'
if (n=='Students'):
while(n!='Grades'):
n=input()
s += n +'~'+'\n'
if (n=='Grades'):
while(n!='EndOfInput'):
n=input()
g += n + '\n'
gl += n
#print(c)
#print(s)
#print(g)
G=g[ :-12]
#print(gl)
#print(G)
S=s[ :-8]
gs=G.split('\n')
#print(G,end='')
#print(gs)
#print(S,end='')
stu=S.split('\n')
#print(stu)
stud=stu[ : -1]
#print(stud)
stut=[]
for a in range(0,len(stud)):
stut += [stud[a].split('~')]
#print(stut)
sorted_stut= sorted(stut)
#print(sorted_stut)
for p in range(0,len(stut)):
if gl.find(stut[p][0])== -1:
gs += ['t~t~t~' + str(stut[p][0])+'~E']
#print(gs)
gsl=[]
for i in range(0,len(gs)):
gsl += [gs[i].split('~')]
#print(gsl)
gslm=[]
for j in range(0,len(gsl)):
gslm += [{gsl[j][3]:gsl[j][4]}]
#print(gslm)
r={}
for d in gslm:
for k,v in d.items():
r.setdefault(k,[]).append(v)
#print(r)
R={}
R=sorted(r.items())
#print(R)
grades=[]
for z in range(0,len(R)):
grades += [R[z][1]]
#print(grades)
glist=[]
for x in range(0,len(grades)):
glist += [gpa(grades[x])]
#print(glist)
outputlist=[]
for x in range(0,len(R)):
outputlist += [[sorted_stut[x][0]] +['~']+[sorted_stut[x][1]]+['~']+ [str(glist[x])]+['\n']]
#print(outputlist)
for x in range(0,len(outputlist)):
print(outputlist[x][0]+outputlist[x][1]+outputlist[x][2]+ outputlist[x][3]+outputlist[x][4])
Thanks
Happy Programming !
>>> onehop([(2,3),(1,2)]) [(1, 3)] >>> onehop([(2,3),(1,2),(3,1),(1,3),(3,2),(2,4),(4,1)]) [(1, 2), (1, 3), (1, 4), (2, 1), (3, 2), (3, 4), (4, 2), (4, 3)] >>> onehop([(1,2),(3,4),(5,6)]) []
def onehop(l):
n=len(l)
oh=[]
for i in range(0,n):
for j in range(0,n):
if ((l[i][1]==l[j][0]) and (l[i][0]!=l[j][1])):
oh += [(l[i][0], l[j][1])]
myset=set(oh)
return(sorted(myset))
Thanks
Happy programming !
>>> frequency([13,12,11,13,14,13,7,11,13,14,12]) ([7], [13]) >>> frequency([13,12,11,13,14,13,7,11,13,14,12,14,14]) ([7], [13, 14]) >>> frequency([13,12,11,13,14,13,7,11,13,14,12,14,14,7]) ([7, 11, 12], [13, 14])
def frequency(l):
m=sorted(l)
d={x:m.count(x) for x in m}
hfelindex=[]
lfelindex=[]
hfel=[]
lfel=[]
k=list(d.keys())
v=list(d.values())
h=max(v)
g=min(v)
for i in range(0,len(v)):
if v[i] == h:
hfelindex += [i]
for j in hfelindex:
hfel += [k[j]]
p=sorted(hfel)
for a in range(0,len(v)):
if v[a] == g:
lfelindex += [a]
for b in lfelindex:
lfel += [k[b]]
q=sorted(lfel)
return((q,p))
Thanks
Happy programming !
1 2 3 4 5 6would be represented as [[1,2,3],[4,5,6]].
1 4 2 5 3 6Write a Python function transpose(m) that takes as input a two dimensional matrix using this row-wise representation and returns the transpose of the matrix using the same representation.
>>> transpose([[1,4,9]]) [[1], [4], [9]] >>> transpose([[1,3,5],[2,4,6]]) [[1,2], [3,4], [5,6]] 0 >>> transpose([[1,1,1],[2,2,2],[3,3,3]]) [[1,2,3], [1,2,3], [1,2,3]]
def transpose(m):
result = [[m[j][i] for j in range(len(m))] for i in range(len(m[0]))]
t=[]
for r in result:
t+= [r]
return(t)
>>> valley([3,2,1,2,3]) True >>> valley([3,2,1]) False >>> valley([3,3,2,1,2]) False
def valley(l):
n=len(l)
downhill=0
uphill=0
for i in range(0,n-1):
if(l[i]>l[i+1]):
downhill +=1
else:
if i==(n-1):
break
elif(l[i]<l[i+1]):
uphill +=1
else:
return(False)
return(True)
Thanks
Happy Programming !
>>> ascending([]) True >>> ascending([3,3,4]) True >>> ascending([7,18,17,19]) False
def ascending(l):
n=len(l)
status=False
if n<=1:
return(True)
for i in range(0,n-1):
if(l[i]<=l[i+1]):
status=True
else:
status=False
break
return(status)
Thanks
Happy Programming !
>>> sumsquares([1,4,9]) 14 >>> sumsquares([10,11,12,15]) 0 >>> sumsquares([16,20,25,30,625]) 666
from math import *
def sumsquares(l):
sum=0
for i in l:
sqr=sqrt(float(i))
if ((sqr-int(sqr))==0.0) :
sum=sum + i
return(int(sum))
>>> depth("22")
0
>>> depth("(a+b)(a-b)")
1
>>> depth("(a(b+c)-d)(e+f)")
2
ef depth(S):
current_max = 0
max = 0
n = len(S)
# Traverse the input string
for i in range(0,n):
if S[i] == '(':
current_max += 1
if current_max > max:
max = current_max
elif S[i] == ')':
if current_max > 0:
current_max -= 1
else:
return -1
# finally check for unbalanced string
if current_max != 0:
return -1
return max
Thanks
Happy Programming !
>>> perfect(6) True >>> perfect(12) False
def perfect(n):
factors_of_n=[]
sum=0
for i in range(1,n+1):
if n%i==0:
factors_of_n = factors_of_n + [i]
for j in factors_of_n[0:-1]:
sum=sum + j
return(sum==n)
Thanks
Happy Programming !