Problem Practice

Jump to bottom

Rishabh Singhal edited this page May 12, 2020 · 5 revisions

Problems Solved

10 MAY 2020

April Lunchtime '13

Solved

MATRIX2 (DP, DP[X][Y-1] & DP[X][Y])
AND (Contribution from each bit)

To Be Solved

SORTING (Persistent SegTree) [To learn]

12 MAY 2020

Codeforces Round 641

Orac and LCM (up-solve)
Solution Ideas: Ans will be 2nd minimum p^k such that p^k_i | a_i
One solution: lcm(gcd(S-{a_i})...) because for n-1 pairs, the answer will be minimum and for 1 pair will be second min. Therefore, lcm(min, max) = max as min | max