All submissions for this problem are available.
Given three ints, a b c, return true if they are in strict increasing order, such as 2 5 11, or
5 6 7, but not 6 5 7 or 5 5 7. When we have the equality bit as 1 then we can have same
number in the set but when we have 0 in equality bit we cannot have equal numbers in it.
the first line is the number of testcases. the second line is the eqality bit either 0 or 1 the third line
is the set of three numbers.
print true if they are increasing order with or without equal number in it based on equality bit.
Input: 2 0 5 6 7 1 2 2 9 Output: true true
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA|
Fetching successful submissions
If you are still having problems, see a sample solution here.