Why do unsigned integers wrap without extensively using the modulo operator in c++?? Suppose , Unsigned int a , b; a and b both are greater than 2^32-1. Then what will be the value of a+b?
so if they don't overflow how can we make them overflow??
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Unsigned integer
Why do unsigned integers wrap without extensively using the modulo operator in c++?? Suppose , Unsigned int a , b; a and b both are greater than 2^32-1. Then what will be the value of a+b?
so if they don't overflow how can we make them overflow??
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | avik26091998 | 2017-10-08 13:54:31 | 13 | Tiny change: ' both are greater than 2^32-1.\n' -> ' both are 2^32-1.\n' | ||
en1 | avik26091998 | 2017-10-08 11:47:07 | 270 | Initial revision (published) |
Name |
---|