2020 Team 13
Source:
February 2, 2020
team2020
Problem Statement
Given points arranged in a equilateral triangular grid of side length , how many ways are there to choose two distinct line segments, with endpoints on the grid, that intersect in exactly one point (not necessarily on the grid)?