A local bank that has 23 branches uses a two-digit code to…

A local bank that has 23 branches uses a two-digit code to represent each of its branches. The same integer can be used for both digits of a code, and a pair of two-digit numbers that are the reverse of each other (such as 17 and 71) are considered as two separate codes. What is the fewest number of different integers required for the 23 codes?

This problem repeats another one in the library (at most with different numbers), so it's left out of browsing.

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #32419