题解 | #自守数#
自守数
http://www.nowcoder.com/practice/88ddd31618f04514ae3a689e83f3ab8e
import math
w = int(input())
b= []
for i in range(w+1):
a = str(pow(i, 2))[::-1]
if str(i)[::-1] == a[:len(str(i))]:
b.append(i)
print(len(b))
w = int(input())
b= []
for i in range(w+1):
a = str(pow(i, 2))[::-1]
if str(i)[::-1] == a[:len(str(i))]:
b.append(i)
print(len(b))
