Hi friends once again I need your help. I am trying to solve this problem spoj.com/problems/MNIU/ but getting WA. I think my algorithm is correct.
[bbone=python,664]import sys
def check(s1,s2):
c=0
for i in xrange(len(s1)):
sb=s1[i]
a=s2.count(sb)
if(a>0):
c+=1
return c
def solve():
tc=int(sys.stdin.readline())
for cs in xrange(tc):
al=0
sys.stdout.write("Case %d: \n"%(cs+1))
names1 = sys.stdin.readline().split()
names2 = sys.stdin.readline().split()
firstn1=names1[0];firstn2=names2[0]
if(firstn1[0] > firstn2[0]):
temp = names1
names1=names2
names2=temp
for l in xrange(len(names1)):
str1=names1[l]
for m in xrange(len(names2)):
str2=names2[m]
#print str1,str2
if((str1[0]==str2[0]) and (str1[len(str1)-1]==str2[len(str2)-1])):
val=check(str1,str2)
#sys.stdout.write(" Checking names ")
#print str1,str2,val
if(val>=3 and (str1!=str2)):
tmp=names1[l]
names1[l]=names2[m]
names2[m]=tmp
al=1
break;
else:
continue
if(al==1):
for k in names1:
sys.stdout.write("%s "%(k))
print""
for x in names2:
sys.stdout.write("%s "%(x))
print""
else:
print"None"
print""
solve()[/bbone]
