Problem

Source:

Tags: combinatorics, combinatorial geometry, Olympiad



Let $n\geq3$ an integer. Mario draws $20$ lines in the plane, such that there are not two parallel lines. For each equilateral triangle formed by three of these lines, Mario receives three coins. For each isosceles and non-equilateral triangle (at the same time) formed by three of these lines, Mario receives a coin. How is the maximum number of coins that can Mario receive?