// Count first-place votes for (int i = 0; i < voters; i++) { for (int j = 0; j < candidates; j++) { if (j == 0) { candidates_list[voters_prefs[i].preferences[j] - 1].votes++; } } } }
recount_votes(voters_prefs, voters, candidates_list, candidates); Cs50 Tideman Solution
// Structure to represent a candidate typedef struct candidate { int id; int votes; } candidate_t; // Count first-place votes for (int i =
// Read in voter preferences for (int i = 0; i < *voters; i++) { (*voters_prefs)[i].preferences = malloc(*candidates * sizeof(int)); for (int j = 0; j < *candidates; j++) { scanf("%d", &(*voters_prefs)[i].preferences[j]); } } } } } } } recount_votes(voters_prefs