gcd
龍木
若人生为棋,我愿为卒,漫漫征途,谁曾见我后退半步
展开
-
D. Two Divisors
链接:https://codeforces.com/contest/1366/problem/D You are givennnintegersa1,a2,…,ana1,a2,…,an. For eachaiaifind itstwo divisorsd1>1d1>1andd2>1d2>1such thatgcd(d1+d2,ai)=1gcd(d1+d2,ai)=1(wheregcd(a,b)gcd(a,b)is the greatest common...原创 2020-07-10 19:33:26 · 289 阅读 · 0 评论 -
C. Orac and LCM
链接:https://codeforces.ml/contest/1350/problem/C For the multiset of positive integerss={s1,s2,…,sk}s={s1,s2,…,sk}, define the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) ofssas follow: gcd(s)gcd(s)is the maximum positive integerxx,...原创 2020-05-21 16:26:32 · 205 阅读 · 0 评论 -
C. Fadi and LCM
链接:https://codeforces.com/contest/1285/problem/C Today, Osama gave Fadi an integerXX, and Fadi was wondering about the minimum possible value ofmax(a,b)max(a,b)such thatLCM(a,b)LCM(a,b)equalsXX....原创 2020-02-02 14:29:52 · 275 阅读 · 1 评论 -
C. Round Corridor
链接:https://codeforces.com/problemset/problem/1200/C Amugae is in a very large round corridor. The corridor consists of two areas. The inner area is equally divided bynnsectors, and the outer area i...原创 2019-12-02 16:27:50 · 158 阅读 · 0 评论