Hello Codeforces!
I'm sorry if this blog is not related to CP!
Is anyone interested in these subscriptions?
Jetbrains — Datacamp or github student pack generally.
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | Um_nik | 161 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
Hello Codeforces!
I'm sorry if this blog is not related to CP!
Is anyone interested in these subscriptions?
Jetbrains — Datacamp or github student pack generally.
I found this problem here. basics — bitwise operations, and this is the link of it.
Any accepted solution depends on a greedy approach that walking from the MSB, but it's clear that it doesn't work on very simple tests like that
3 4
1 1 4
The greedy approach makes X = 4 which give a result = 10, the real solution must make X = 2, so the result = 12.
That means there's a bug in this problem, so any suggestions to solve it with a trusted approach?
Name |
---|