The code below works, and doesn’t take too long to run. I have submitted it as Python 3. Any suggestions to improve?
a = int(input())
arr= []
ans= []
for i in range(0,a):
arr.append(input())
def reverser(j):
b = ""
rev = str(j)
for k in range(0,len(rev)):
b = b + rev[len(str(j))-1-k]
return(int(b))
#print(len(str(arr[0])))
loop = 0
for k in arr:
t = int(k)
while loop<1:
if t==reverser(t):
ans.append(t)
break
else:
t=t+1
for g in ans:
print(g)
created
last reply
- 3
replies
- 801
views
- 2
users
- 1
link