题目描述:
自守数是指一个数的平方的尾数等于该数自身的自然数。例如:25^2 = 625,76^2 = 5776,9376^2 = 87909376。请求出n以内的自守数的个数,例如:
输入:2000
输出:8
代码实现:
while True:
try:
count = 0
a = input()
#print(type(a))
b = len(a)
#print(b)
for i in range(0,int(a)+1):
#print(type(i))
num1 = str(i**2)
#print(num1)
#print(i)
#print(num1[-len(str(i)):] == str(i))
#print(type(num1[-(len(num1)-b+1):]))
if num1[-len(str(i)):] == str(i):
count = count +1
print(count)
except :
break
运行结果: