Why do unsigned integers wrap without extensively using the modulo operator in c++?? Suppose , Unsigned int a , b; a and b both are 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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
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 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 |
---|