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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 - XOR Equation 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.