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??
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.12.2024 13:51:26 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
why not run it yourself to find out? this seems to be easily tested out right?
Yeah..i ran it i did'nt understand.. .please if you know help..
what do you actually mean by overflow? For what happen with a+b, the value stored in a and b cannot be greater than 2^32-1, so it will just store the modulo of 2^32. read this
for your updated question, it will be 4294967294 which is 2^32-2.as 2^32-1+2^32-1 = 2*(2^32) — 2 = -2 (mod 2^32)
Note that some languages (C and C++ are the most notable examples) include the notion of "undefined behavior", meaning that an experiment can be ill-defined and one cannot draw any conclusions from it.
Not for overflowing unsigned integers, though. If he knew about undefined behavior (I doubt it) but didn't know whether unsigned integer overflow was considered such, then google is a friend of his.