0
Your rating: None
CodeChef submission 99312 (PYTH) 

CodeChef submission 99312 (PYTH) plaintext list. Status: WA, problem PALIN, contest . By phoenix24 (phoenix24), 2009-09-29 12:18:54.
  1. #!/usr/bin/python
  2.  
  3. lines=int(raw_input())
  4.  
  5. for i in xrange(lines):
  6. 		number=raw_input().strip()
  7. 		odd=False
  8. 		numparts=[]
  9. 		size=len(number)
  10. 		shstarts=0
  11. 		if size&1:
  12. 				# [left side reversed,right side]
  13. 				numparts=[number[size/2-1::-1],number[size/2+1:]]
  14. 				shstarts=(size/2)+1
  15. 		else:
  16. 				#[left side reversed,right side]
  17. 				numparts=[number[size/2-1::-1],number[size/2:]]
  18. 				shstarts=size/2
  19. 		revl=numparts[0]
  20. 		right=numparts[1]
  21. 		numparts.sort()
  22. 		if (revl is numparts[1]) and (revl is not right):
  23. 				if size&1:
  24. 						print ''.join([number[:(size/2)+1],revl])
  25. 				else:
  26. 						print ''.join([number[:size/2],revl])
  27. 		else:
  28. 				#palindrome of left equal or less than rhs inc left then mirror
  29. 				fh=''
  30. 				nresult=number[:shstarts].rstrip('9')
  31. 				nrsize=len(nresult)
  32. 				if nrsize<shstarts :
  33. 						if nrsize==0:
  34. 								fh=''.join(['1','0'*shstarts])
  35. 						else:
  36. 								fh=''.join([nresult[:-1],chr(ord(nresult[-1])+1),'0'*(shstarts-nrsize)])
  37. 				else:
  38. 						fh=''.join([number[:shstarts-1],chr(ord(number[shstarts-1])+1)])
  39. 				print ''.join([fh,fh[size/2-1::-1]])
  40.

Comments