摘要：
##求最小值 while (l<r) { int mid= (l+r)>>1; if (check (mid)) r=mid; else l=mid+1; } ##求最大值 while (l<r) { int mid= (l+r+1)>>1; if (check (mid)) l=mid; else 阅读全文
摘要：
##Problem B ###题面 In Omkar's last class of math, he learned about the least common multiple, or LCM. LCM(a,b) is the smallest positive integer x which 阅读全文