-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path47Sum_Solution_bits.py
45 lines (38 loc) · 1.34 KB
/
47Sum_Solution_bits.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
def Sum_Solution(n):
def f(x):
return 0xffffffff if x&1 else 0
a, b, s = n, n+1, 0
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
s += b & f(a); a >>= 1; b <<= 1
return s >> 1
print(Sum_Solution(100))