This program illustrates the use of the STL binary_search() algorithm (extended
version) to determine whether an integer having the same digit sum as a given
integer exists among the integers in a vector of integers. The integer values
being searched are assumed to be ordered in the sense that an integer with a
smaller digit sum precedes one with a larger digit sum.
Press Enter to continue ...

Here are the values in the vector:
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 ...

A value with the same digit sum as 11 was not found.
Press Enter to continue ...

A value with the same digit sum as 13 was found.
Press Enter to continue ...

A value with the same digit sum as 31 was found.
Press Enter to continue ...

A value with the same digit sum as 41 was found.
Press Enter to continue ...

A value with the same digit sum as 77 was found.
Press Enter to continue ...

A value with the same digit sum as 78 was not found.
Press Enter to continue ...