গণিতযজ্ঞের ফুটবল


Gonitzoggo has arranged a Football tournament where there are $8$ football teams. Eight football teams play matches against each other in such a way that no two teams meet twice and no three teams play all of the three possible matches; for example, If $A$ plays with $B$ and $B$ plays with $C$, $C$ doesn’t play with $ A$. Find out the largest total number of matches possible in the tournament. 


Combinatorics  


  9 Upvotes                    1 Downvotes

Editorial



Need a hint? Checkout the editorial.

View Editorial


Statistics



Attempt 27


Solve 11


First Solve ivanputun