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 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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