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:51:00 +00:00
parent 377be87862
commit 259eddc707
1 changed files with 13 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
du2/program.c
View File

@ -41,9 +41,12 @@ int main() {
int x = 0; int x = 0;
//spracovanie inputu, vycitavanie najdenych mien a najdenych poctov hlasov z retazca //spracovanie inputu, vycitavanie najdenych mien a najdenych poctov hlasov z retazca
while (sscanf(line, "%d %s %s", &najdPocetHlasov, najdMeno, najdPriezvisko) != -1) //bude citat dovtedy, pokial nedosiahne limit studentDB array-u (20 prvkov max) alebo fgets() sa nedostane na koniec suboru
while (x < 20 && fgets(line, SIZE, stdin) != NULL)
{ {
//prekopiruje najdene priezviska if(sscanf(line, "%d %s %s", &najdPocetHlasov, najdMeno, najdPriezvisko) == 3)
{
//prekopiruje najdene priezviska (iba ak sscanf() najde vsetky 3 hodnoty)
strcpy(DBStudenti[x].meno, najdMeno); strcpy(DBStudenti[x].meno, najdMeno);
strcpy(DBStudenti[x].priezvisko, najdPriezvisko); strcpy(DBStudenti[x].priezvisko, najdPriezvisko);
DBStudenti[x].pocetHlasov = najdPocetHlasov; DBStudenti[x].pocetHlasov = najdPocetHlasov;
@ -53,6 +56,7 @@ int main() {
// memset(najdMeno, 0, SIZE); // memset(najdMeno, 0, SIZE);
najdPocetHlasov = 0; najdPocetHlasov = 0;
} }
}
//zoradenie zoznamu, resp. arrayu //zoradenie zoznamu, resp. arrayu
qsort(DBStudenti, 20, sizeof(struct student), compare); qsort(DBStudenti, 20, sizeof(struct student), compare);