Define a function to find the largest integer divisible by n and less than t. Of course, I can't define the function, so I just write it down, but I'm stuck on finding the biggest factor.)

the reference answer GPT ᴼ ᴾ ᴱ ᴺ ᴬ ᴵ < br / > you can declare a variable within the loop, to save the current maximum of find. This variable is updated to the new value each time a factor greater than the current maximum value is found. At the end of the loop, this variable is the largest factor.

Example code:

n = int(input("input a integer: "))
t = int(input("input another integer: "))
max_factor = 0  # 定义一个变量，用于保存当前找到的最大值

for i in range(1, n+1):
    if n % i == 0 and i < t:
        if i > max_factor:  # 如果找到的因子比当前最大值更大，就更新最大值
            max_factor = i

print("最大的因子是:", max_factor)

Note that this program can only find the largest of the factors less than t. If you want to find all factors less than t, and find the largest one among them, you can change the part that updates the maximum to a list operation, as follows:

n = int(input("input a integer: "))
t = int(input("input another integer: "))
factors = []  # 定义一个列表，用于保存所有符合条件的因子

for i in range(1, n+1):
    if n % i == 0 and i < t:
        factors.append(i)  # 将符合条件的因子添加到列表中

if len(factors) > 0:  # 如果列表不为空，说明找到了符合条件的因子
    max_factor = max(factors)  # 使用max函数获取最大值
    print("最大的因子是:", max_factor)
else:
    print("没有找到符合条件的因子")