21 января 2024
from math import gcd
def is_coprime(a, b):
return gcd(a, b) == 1
def solve (N, A):
dp = [1] * N
for i in range(1, N):
for j in range(i):
if A[i] > A[j] and not is_coprime(A[i], A[j]):
dp[i] = max(dp[i], dp[j] + 1)
return max(dp)
Done ✅
3.2K ·