7 589
订阅者
-424 小时
-357 天
-6330 天
帖子存档
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 ✅
IBM CODEKNACK slots are opened.
For IBM slots 👇👇
mlcoder2
HCL slot-10 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-9 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-9 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-8 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-7 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-4 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-5 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
HCL slot-4 done ✅
All 5 sections completed ✅
Each and every section is an elimination round ✅
Contact: @mlcoder2
现已上线!2025 年 Telegram 研究 — 年度关键洞察 
