Counting in a Fighting Game Club
Source: Myanmar IMO Training 2024
July 4, 2024
combinatoricsgraph theoryEasy Combinatorics
Problem Statement
A fighting game club has members. One day, a game of Smash is played between some pairs of members so that every member has played against exactly other members. Each match has a winner and a loser. A member will be happy if they won in at least of the matches. What is the maximum number of happy members over all possible match-ups and all possible outcomes?