Can someone share their ideas on the following problem?
https://www.codechef.com/problems/CHN16H
The problem is from ACM-ICPC 2016 Chennai Onsite Round.
Thanks!
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Can someone share their ideas on the following problem?
https://www.codechef.com/problems/CHN16H
The problem is from ACM-ICPC 2016 Chennai Onsite Round.
Thanks!
Name |
---|
627A - Уравнение с исключающим ИЛИ same problem in CodeForces.com !
try to use :
Actually, the problem deals with triplets instead of pairs so I am not sure if the idea can be extended here.
Well my solution can easily be extended. The idea is to use DP on the binary representation. And the state is:
dp[current bit][carry in sum] = triples of binary numbers of length [current bit] with given carry in the previous addition.
But there is still more to the problem. Please read it again.