In the following code, is product guaranteed to contain a correct answer:
int num=INT_MAX, num2=INT_MAX;
long long product = num1 * num2;
Asked
Active
Viewed 120 times
0
Natan Yellin
- 6,063
- 5
- 38
- 57
-
5No, you must cast one of the multipliers. `long long product = (long long)num1 * num2;` – Weather Vane Nov 20 '17 at 08:54
-
3There are only `int` values involved in the multiplication. Why should there be any type promotion? The assignement of the result only happens after the calculation is done. – Gerhardh Nov 20 '17 at 08:55
-
the rule is that ~everything is promoted to int; or an integer type of greater rank if not all values of both operand types can be represented in a int... – Antti Haapala -- Слава Україні Nov 20 '17 at 09:00
-
You will want to look at [C11 Standard - 6.3.1.1 Boolean, characters, and integers](https://port70.net/~nsz/c/c11/n1570.html#6.3.1.1) and see *Note 58*. – David C. Rankin Nov 20 '17 at 09:05
-
@Gerhardh the problem is that multiplying 2 n-bit numbers produce a 2n-bit number, so what the OP asked is valid – phuclv Nov 20 '17 at 09:17
-
@LưuVĩnhPhúc yes, but an overflow alone is no trigger for some type propagation. – Gerhardh Nov 20 '17 at 09:20