Well played Unacademy by making Codechef Pro. Who is waiting for Codeforces Pro after Codechef Pro? Just Kidding Guys.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Well played Unacademy by making Codechef Pro. Who is waiting for Codeforces Pro after Codechef Pro? Just Kidding Guys.
Problem link I did not find any better solution in the discuss section of leetcode that's why posting here.
1 — link of the first problem 2 — link of second problem thanks in advance.
Given an array A of N elements, you can pick at most one element of the array and increment or decrement it by any value. The task is to maximize the AND of the resulting array.
Note: AND of the array is defined as the bitwise AND(&) of all the array elements.
Constraints: 2 ≤ N ≤ 2 * 10^5 0 ≤ A[i] ≤ 2 * 10^9
Name |
---|