Cs50 Tideman Solution -

def main(): # Get the number of candidates and voters candidates = [] num_candidates = int(input("Enter the number of candidates: ")) for i in range(num_candidates): candidate = input(f"Enter candidate {i+1}: ") candidates.append(candidate)

# Find the candidate with the fewest votes min_votes = min(vote_counts.values()) min_vote_candidates = [candidate for candidate, count in vote_counts.items() if count == min_votes] Cs50 Tideman Solution

def tideman(candidates, pairs): # Count first-choice votes vote_counts = {candidate: 0 for candidate in candidates} for pair in pairs: vote_counts[pair[0]] += 1 def main(): # Get the number of candidates