This program illustrates the use of the STL equal_range() algorithm (extended
version) to find the lower bound and upper bound locations of a given target
value in a vector of integers ordered in the sense that one integer precedes
another if the digit sum in the first is less than the digit sum in the second.
Press Enter to continue ...

Here are the contents of v:
21 13 31 40 5 51 25 52 70 8 62 71 45 54 55 82 38 56 65 92 39 48 75 49 59 88
Press Enter to continue ...

Lower bound of 85 in v = 49
Upper bound of 85 in v = 59
Press Enter to continue ...

Lower bound of 96 in v = 88
Upper bound of 96 in v = 88
Press Enter to continue ...

Lower bound of 73 in v = 55
Upper bound of 73 in v = 38
Press Enter to continue ...

Lower bound of 1 in v = 21
Upper bound of 1 in v = 21
Press Enter to continue ...

Note that both the lower and upper bound locations
of 99 are the end (one-past-the-last) vector position.
Press Enter to continue ...