vd768er/pvjc24
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

cv5

Browse Source
This commit is contained in:
Džubara 2024-03-22 00:13:18 +01:00
parent 515acee63a
commit 0d6e6aadd2
1 changed files with 31 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

58
cv5/program.c
View File

@ -15,32 +15,26 @@ int compare(const void* p1, const void* p2) {
const struct student* s2 = (const struct student*)p2; const struct student* s2 = (const struct student*)p2;
// Porovnanie podľa počtu hlasov // Porovnanie podľa počtu hlasov
return s2->votes - s1->votes; int result = s2->votes - s1->votes;
} if (result == 0) {
// Ak majú rovnaký počet hlasov, zoradíme lexikograficky podľa mena
// Funkcia na vyhľadanie študenta v databáze return strcmp(s1->name, s2->name);
int find_student(struct student* students, int size, const char* name) {
for (int i = 0; i < size; i++) {
if (strcmp(students[i].name, name) == 0) {
return i; // Nájdený študent
} }
} return result;
return -1; // Študent nenájdený
} }
int main() { int main() {
struct student database[SIZE]; struct student students[SIZE];
memset(database, 0, SIZE * sizeof(struct student)); memset(students, 0, SIZE * sizeof(struct student));
int size = 0; int size = 0;
char line[SIZE]; char line[SIZE];
char name[SIZE]; char name[SIZE];
int votes; int votes;
while (1) { printf("Enter votes for 'Student of the Year' contest (or 'q' to quit):\n");
printf("Enter votes and student name (or 'q' to quit): ");
fgets(line, SIZE, stdin);
while (fgets(line, SIZE, stdin) != NULL) {
// Kontrola ukončenia vstupu // Kontrola ukončenia vstupu
if (strcmp(line, "q\n") == 0 || strcmp(line, "Q\n") == 0) { if (strcmp(line, "q\n") == 0 || strcmp(line, "Q\n") == 0) {
break; break;
@ -48,34 +42,42 @@ int main() {
// Načítanie počtu hlasov a mena zo vstupu // Načítanie počtu hlasov a mena zo vstupu
if (sscanf(line, "%d %[^\n]", &votes, name) != 2) { if (sscanf(line, "%d %[^\n]", &votes, name) != 2) {
printf("Invalid input. Please try again.\n"); printf("Invalid input format. Exiting.\n");
continue; return 1;
} }
// Vyhľadanie študenta v databáze // Vyhľadanie študenta v databáze
int index = find_student(database, size, name); int index = -1;
for (int i = 0; i < size; i++) {
if (strcmp(students[i].name, name) == 0) {
index = i;
break;
}
}
// Ak študent nie je v databáze, pridáme ho
if (index == -1) { if (index == -1) {
// Študent nenájdený, pridáme ho do databázy
if (size < SIZE) { if (size < SIZE) {
strcpy(database[size].name, name); strcpy(students[size].name, name);
database[size].votes = votes; students[size].votes = votes;
size++; size++;
} else { } else {
printf("Database is full.\n"); printf("Database is full. Exiting.\n");
return 1;
} }
} else { } else {
// Študent nájdený, zvýšime počet hlasov // Ak študent už existuje, zvýšime počet hlasov
database[index].votes += votes; students[index].votes += votes;
} }
} }
// Triedenie databázy podľa počtu hlasov // Triedenie databázy podľa počtu hlasov a mena
qsort(database, size, sizeof(struct student), compare); qsort(students, size, sizeof(struct student), compare);
// Výpis triedenej databázy // Výpis výsledkov
printf("\nResults:\n"); printf("\nResults:\n");
for (int i = 0; i < size; i++) { for (int i = 0; i < size; i++) {
printf("%d %s\n", database[i].votes, database[i].name); printf("%d %s\n", students[i].votes, students[i].name);
} }
return 0; return 0;