Given two positive and distinct numbers, the task is to find the greatest of two given numbers without using any conditional statements(if…) and operators(?: in C/C++/Java).
Input: a = 14, b = 15 Output: 15 Input: a = 1233133, b = 124 Output: 1233133
The Approach is to return the value on the basis of the below expression:
a * (bool)(a / b) + b * (bool)(b / a)
The expression a / b will give 1 if a > b and 0 if a < b (only after typecasting the result to bool).
Hence, the answer will be of the form either a + 0 or 0 + b depending upon which one is greater.
- Numbers less than N which are product of exactly two distinct prime numbers
- Maximum sum of distinct numbers such that LCM of these numbers is N
- Add two numbers without using arithmetic operators
- Russian Peasant (Multiply two numbers using bitwise operators)
- Maximum sum of distinct numbers with LCM as N
- Numbers having Unique (or Distinct) digits
- Exactly n distinct prime factor numbers from a to b
- Print combinations of distinct numbers which add up to give sum N
- Find N distinct numbers whose bitwise Or is equal to K
- Check if all sub-numbers have distinct Digit product
- Count of N-digit numbers with all distinct digits
- Find two distinct prime numbers with given product
- Count of distinct remainders when N is divided by all the numbers from the range [1, N]
- Number of distinct prime factors of first n natural numbers
- Largest Even and Odd N-digit numbers
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.