I ask if i can calculate xor to all numbers in a specific range without using loop
for example if i have
start=3
end =3211233432145321;
the result start ^ start+1 ^ start+2 ^ start+3.........end-1^end
Thanks in advanced.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
10 | BledDest | 144 |
I ask if i can calculate xor to all numbers in a specific range without using loop
Name |
---|
Finally,
you mention that you need only last 4 numbers so to calculate f(x)
f(x)=(x-3)^(x-2)^(x-1)^(x)
i test it by using this function vs bruteforce solution but the result different.
I wrote C++ code for this: https://github.com/liruqi/topcoder/blob/master/leetcode/exclusive-or-of-numbers-range.cpp