You are given three integers n, x, and y.
There are n houses numbered from n located along a street. For every n x and house y.
Return an array result of length n where result[k - 1] represents the total number of pairs of houses n.
Note: A pair of houses
must consist of distinct houses, and the pair is ordered, which means and are counted as distinct pairs.
Constraints:
n
x, y n
You are given three integers n, x, and y.
There are n houses numbered from n located along a street. For every n x and house y.
Return an array result of length n where result[k - 1] represents the total number of pairs of houses n.
Note: A pair of houses
must consist of distinct houses, and the pair is ordered, which means and are counted as distinct pairs.
Constraints:
n
x, y n