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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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