tv899jv/pvjc26
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Aktualizovat du2/program.c

Browse Source
This commit is contained in:
Tomáš Vlček 2026-03-11 23:32:31 +00:00
parent 2f6528ce7b
commit b8de26520a
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
du2/program.c
View File

@ -11,6 +11,7 @@ int compare(const void* p1, const void* p2);
struct student {
int pocetHlasov;
char meno[SIZE];
char priezvisko[SIZE];
};
int main() {
@ -39,16 +40,16 @@ int main() {
int x = 0;
//spracovanie inputu, vycitavanie najdenych mien a najdenych poctov hlasov z retazca
while (sscanf(line, "%d %s", &najdPocetHlasov, najdMeno) != -1)
while (sscanf(line, "%d %s %s", &najdPocetHlasov, najdMeno, najdPriezvisko) != -1)
{
// DBStudenti[x].meno = najdMeno;
// DBStudenti[x].pocetHlasov = najdPocetHlasov;
//prekopiruje najdene priezviska
strcpy(DBStudenti[x].meno, najdMeno);
strcpy(DBStudenti[x].priezvisko, najdPriezvisko);
DBStudenti[x].pocetHlasov = najdPocetHlasov;
x += 1;
//reset nacitanych hodnot na konci kazdeho cyklu
memset(najdMeno, 0, SIZE);
// memset(najdMeno, 0, SIZE);
najdPocetHlasov = 0;
}
@ -81,7 +82,7 @@ int main() {
if (s1->pocetHlasov == s2->pocetHlasov)
{
//vrati lexikografciky zorad. instancie v poli
//vrati lexikograficky zorad. instancie v poli (podla mena, NIE priezviska)
return strcmp(s2->meno, s1->meno);
}