Hi —
Recently I took look at problem from Hackerrank BACK TO SCHOOL CODESPRINT called Xor Subsequence. I'm wondering if there is solution to this problem that doesn't utilize FFT.
# | 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 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | Vladosiya | 144 |
9 | nor | 144 |
Hi —
Recently I took look at problem from Hackerrank BACK TO SCHOOL CODESPRINT called Xor Subsequence. I'm wondering if there is solution to this problem that doesn't utilize FFT.
Name |
---|
Frankly saying I don't know an answer to your question, but I will leave this as a fun fact that if we will allow also empty subsequences of form [i, i) (so in fact we increase number of occurences of zero by n) then answer will be always 0 :). It follows from an inequality
which shows up in comparing number of occurences of zeros and some other value. Without adding those empty intervals that inequlity changes to
, which in fact is not true :(. Or maybe I should say ":)", because that means that this problem has any sense :D.