这样是可以通过的
第一题:
def is_up():
arr = input().split(' ')
v1 = list(map(int, arr[0].split('.')))
v2 = list(map(int, arr[1].split('.')))
len_v1 = len(v1)
len_v2 = len(v2)
min_len = min(len_v1, len_v2)
to_up = False
for k in range(min_len):
if v1[k] < v2[k]:
to_up = True
rs.append('true')
return
elif v1[k] > v2[k]:
rs.append('false')
return
s1 = '0'
if len_v1 < len_v2:
for n1 in v2[min_len:]:
s1 += str(n1)
s1_num = float(s1)
if s1_num > 0:
to_up = True
if to_up:
rs.append("true")
else:
rs.append("false")
m = int(input())
rs = []
for i in range(m):
is_up()
for i in rs:
print(i)
第二题:
def f(arr):
set_num = set()
sum = 0
while len(arr) > 0:
temp = arr.pop()
sum += temp ** 2
if sum in set_num:
result.append('false')
return
else:
set_num.add(sum)
if sum != 1:
for k in str(sum):
arr.append(int(k))
f(arr)
else:
result.append('true')
return
def check():
s = input()
arr = []
if s == '1':
result.append('true')
return
for i in s:
arr.append(int(i))
f(arr)
m = int(input())
result = []
for i in range(m):
check()
for r in result:
print(r)