def is_prime(x): for j in range(2,x): if x % j == 0: return False return True for n in range(1,1000): s =">" + 20 * "4" + 15 * "5" + n * "6" whi

Вопрос пользователя:

def is_prime(x): for j in range(2,x): if x % j == 0: return False return True for n in range(1,1000): s =">" + 20 * "4" + 15 * "5" + n * "6" while (">4" in s) or (">5" in s) or (">6" in s): if ">4" in s: s = s.replace(">4", "67>", 1) if ">5" in s: s = s.replace(">5", "23>", 1) if ">6" in s: s = s.replace(">6", "3>", 1) if is_prime(x) == True: print(n) break n += 1 исправь ошибку

Ответ нейросети:

def is_prime(x): for j in range(2,x): if x % j == 0: return False return True

n = 1 while n < 1000: s = ">4" + 20 * "4" + 15 * "5" + n * "6" while (">4" in s) or (">5" in s) or (">6" in s): if ">4" in s: s = s.replace(">4", "67>", 1) if ">5" in s: s = s.replace(">5", "23>", 1) if ">6" in s: s = s.replace(">6", "3>", 1) if is_prime(n): print(n) break n += 1

Напишите нам, если в вопросе есть ваши персональные данные ([email protected])

Последние вопросы: