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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
8 | SecondThread | 146 |
10 | pajenegod | 145 |
I ask if i can calculate xor to all numbers in a specific range without using loop
Название |
---|
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