First, players are sorted alphabetically by name, then for each guest in turn a team number is randomly selected from teams that still have space. a team can have 5 players
to calculate all the possible different allocations of players to teams that are possible, would K just treat this as permutation without replacement and use this formula P!/(P−T)!, getting 25!/20!
players= set(ascii_uppercase[:25]
teams = {(p) for p in permutations((ascii_uppercase),5)}
Is this the correct way to calculate this, or am i doing it wrong?