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 | 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 |
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.