1991.md (1450B)
1 Source: https://codeforces.com/blog/entry/132021 2 3 [1991A - Maximize the Last Element](/contest/1991/problem/A) 4 5 **Video editorial** 6 7 [1991B - AND Reconstruction](/contest/1991/problem/B) 8 9 **Idea** 10 11 Find minimum possible value of each $A_i$, then check if it gives you $B$ 12 13 **Video editorial** 14 15 [1991C - Absolute Zero](/contest/1991/problem/C) 16 17 **Hint** 18 19 Can you decrease maximum by half in one operation? 20 21 **Video editorial** 22 23 [1991D - Prime XOR Coloring](/contest/1991/problem/D) 24 25 **Hint 1** 26 27 The answer is always <= 4. 28 29 **Hint 2** 30 31 If $u$ and $v$ both have same remainder when divided by 4, then $u \oplus v$ is a multiple of $4$. 32 33 **Video editorial** 34 35 **Bonus: How to write checker for D?** 36 37 [XOR Convolution](https://serbanology.herokuapp.com/vault/A%20Bitwise%20Convolution%20Tutorial) 38 39 [1991E - Coloring Game](/contest/1991/problem/E) 40 41 **Hint 1** 42 43 What should be alice strategy? 44 45 **Hint 2** 46 47 Alice should always chose color 1 and 2. 48 49 **Hint 3** 50 51 When can Bob color all the vertices using 2 colors? 52 53 **Hint 4** 54 55 Bob can color all the vertices using just 2 colors if graph is [Bipartite graph](https://en.wikipedia.org/wiki/Bipartite_graph) 56 57 **Hint 5** 58 59 Play as Bob if graph is [Bipartite graph](https://en.wikipedia.org/wiki/Bipartite_graph) and Alice otherwise. 60 61 **Video editorial** 62 63 [1991F - Triangle Formation](/contest/1991/problem/F) 64 65 **Hint** 66 67 The answer is always YES, if $R-L \gt C$ for some $C$ 68 69 **Video editorial** 70 71 **Daily Chat QnA**