Company: Tavant_._
Difficulty: medium
Louie and Pairs body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Helvetica Neue", "Arial", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2 { border-bottom: 2px solid #eee; padding-bottom: 10px; } h1 { font-size: 2em; } h2 { font-size: 1.5em; } code { background-color: #f4f4f4; padding: 2px 4px; border-radius: 4px; font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; } pre { background-color: #f4f4f4; padding: 15px; border-radius: 5px; white-space: pre-wrap; word-wrap: break-word; } ul { padding-left: 20px; } li { margin-bottom: 10px; } Louie and Pairs Louie wants to determine the number of ordered pairs ( x , y ) such that 1 ≤ x ≤ bound_x and 1 ≤ y ≤ bound_y , and the following equation has an integer value: (√x + √y) 2 . Note: pairs (1, 2) and (2, 1) are different, so they should be considered twice in the final answer. Input The first line o