| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- concurrency
- Generator
- DWG
- 109. Convert Sorted List to Binary Search Tree
- 프로그래머스
- 운영체제
- Python
- 밴픽
- Substring with Concatenation of All Words
- Regular Expression
- 315. Count of Smaller Numbers After Self
- iterator
- kaggle
- Class
- 컴퓨터의 구조
- 43. Multiply Strings
- data science
- 시바견
- 715. Range Module
- shiba
- 파이썬
- Protocol
- t1
- LeetCode
- 30. Substring with Concatenation of All Words
- Decorator
- Python Code
- Python Implementation
- attribute
- Convert Sorted List to Binary Search Tree
Archives
- Today
- Total
목록Bit Operations (1)
Scribbling
Python Int Representation & Bit Operations
Each of programming language has their own way of 'Integer Representation'. In most languages, integers are represented with 32 bits and the most significant bit (the leftmost bit) is for the sign of it. As a result, usual '32-bit int representation' has range of [-2**31+1, 2**31]. * 2**31 (INT_MAX) is 0xFFFFFFFF * -2*31+1 (-INT_MAX) is 0x80000000 (by 2's complement) However, python has somewhat..
Computer Science/Python
2022. 1. 13. 12:05