input: Write a Python function called calculate_house_pairs that takes three integers n, a, and b. In a city, houses are numbered from 1 to n and are connected by n-1 streets. Each house i is connected to house i+1 for all 1 <= i <= n-1. Additionally, another street connects the houses numbered a and b.
  
  For each value k in the range 1 to n, the function should calculate the number of pairs of houses (house1, house2) such that the minimum number of streets required to travel from house1 to house2 is k. The function should return a list of length n where element k represents the number of such pairs for distance k.
  
  Return a 1-indexed array where each element corresponds to the number of pairs of houses that need k streets to connect.
  
  Constraints:
  2 <= n <= 100
  1 <= a, b <= n
output: def calculate_house_pairs(n, a, b):
      result = [0] * (n + 1)
      for i in range(1, n):
          for j in range(i + 1, n + 1):
              dist = min(j - i, abs(i - a) + 1 + abs(j - b), abs(i - b) + 1 + abs(j - a))
              result[dist] += 1
      return result[1:]