118 lines
2.7 KiB
C
118 lines
2.7 KiB
C
#include <cs50.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
// Max number of candidates
|
|
#define MAX 9
|
|
|
|
// Candidates have name and vote count
|
|
typedef struct
|
|
{
|
|
string name;
|
|
int votes;
|
|
} candidate;
|
|
|
|
// Array of candidates
|
|
candidate candidates[MAX];
|
|
|
|
// Number of candidates
|
|
int candidate_count;
|
|
|
|
// Function prototypes
|
|
bool vote(string name);
|
|
void print_winner(void);
|
|
|
|
int main(int argc, string argv[])
|
|
{
|
|
// Check for invalid usage
|
|
if (argc < 2)
|
|
{
|
|
printf("Usage: plurality [candidate ...]\n");
|
|
return 1;
|
|
}
|
|
|
|
// Populate array of candidates
|
|
candidate_count = argc - 1;
|
|
if (candidate_count > MAX)
|
|
{
|
|
printf("Maximum number of candidates is %i\n", MAX);
|
|
return 2;
|
|
}
|
|
for (int i = 0; i < candidate_count; i++)
|
|
{
|
|
candidates[i].name = argv[i + 1];
|
|
candidates[i].votes = 0;
|
|
}
|
|
|
|
int voter_count = get_int("Number of voters: ");
|
|
|
|
// Loop over all voters
|
|
for (int i = 0; i < voter_count; i++)
|
|
{
|
|
string name = get_string("Vote: ");
|
|
|
|
// Check for invalid vote
|
|
if (!vote(name))
|
|
{
|
|
printf("Invalid vote.\n");
|
|
}
|
|
}
|
|
|
|
// Display winner of election
|
|
print_winner();
|
|
}
|
|
|
|
// Update vote totals given a new vote
|
|
bool vote(string name)
|
|
{
|
|
// Iterate over each candidate
|
|
for (int i = 0; i < candidate_count; i++)
|
|
{
|
|
// Check if candidate's name matches given name
|
|
if (strcmp(candidates[i].name, name) == 0)
|
|
{
|
|
// If yes, increment candidate's votes and return true
|
|
candidates[i].votes += 1;
|
|
return true;
|
|
}
|
|
}
|
|
// If no match, return false
|
|
return false;
|
|
}
|
|
|
|
// Print the winner (or winners) of the election
|
|
void print_winner(void)
|
|
{
|
|
// Find the maximum number of votes
|
|
int max = 0;
|
|
int winnerCount = 0;
|
|
candidate winners[MAX];
|
|
|
|
for (int i = 0; i < candidate_count; i++)
|
|
{
|
|
if (candidates[i].votes > max)
|
|
{
|
|
// Found new max and save the candidate only
|
|
// printf("%s has the most votes currently!\n", candidates[i].name);
|
|
winnerCount = 0;
|
|
winners[0] = candidates[i];
|
|
max = candidates[i].votes;
|
|
}
|
|
else if (candidates[i].votes == max)
|
|
{
|
|
// Found new equal max and save the candidate addtl
|
|
winnerCount += 1;
|
|
// printf("%s has the equal votes compared to %s!\n", candidates[i].name, winners[winnerCount -1].name);
|
|
winners[winnerCount] = candidates[i];
|
|
}
|
|
}
|
|
|
|
// Print the candidate (or candidates) with maximum votes
|
|
for (int i = 0; i <= winnerCount; i++)
|
|
{
|
|
printf("%s\n", winners[i].name);
|
|
}
|
|
|
|
return;
|
|
}
|