fork download
copy 
  1. # your code goes here
  2. def isPalindrome(num):
  3.     return str(num) == str(num)[::-1]
  4.  
  5. def check(n):
  6. 	for num in reversed(range(n)):
  7. 		if(isPalindrome(num)):
  8. 			num1 = num
  9. 			break
  10. 	for x in range(n+1,1000000):
  11. 		if(isPalindrome(x)):
  12. 			num2 = x
  13. 			break
  14. 	return num1+num2
  15.  
  16. n = int(input())
  17. for inum in reversed(range(n+1)):
  18. 	onum = check(inum)
  19. 	if(isPalindrome(onum)):
  20. 		print(onum)
  21. 		break
Success #stdin #stdout 0.06s 39136KB
comments (?)
stdin
copy 
67
stdout
copy 
121
https://ideone.com/kbTxFp
language:
Python (cpython 2.7.16)
created:
2 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!