Editorial for UTS Open '18 P1 - Love Triangle

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: PlasmaVortex

The problem simply asks you to print $\max(N+M, |N-M|, N\cdot M)$ $max (N + M, | N - M |, N \cdot M)$ . Make sure to use 64-bit integers to prevent overflow errors.

Time Complexity: $\mathcal{O}(1)$ $O (1)$

Comments

There are no comments at the moment.