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

Initialization

Browse Source
This commit is contained in:
Kozar 2024-04-25 18:32:35 +02:00
parent ebd2341fdf
commit 7576de98d7
1 changed files with 33 additions and 47 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

80
cv10/program.c
View File

@ -1,63 +1,49 @@
#include <stdio.h> #include <stdio.h>
#include <stdlib.h>
#include <string.h> #include <string.h>
#define MAX_STUDENTS 100 #define MAX_LENGTH 100 // Maximálna dĺžka mena študenta
#define NAME_SIZE 50 #define MAX_STUDENTS 100 // Maximálny počet študentov
int compare(const void *a, const void *b) {
return strcmp(*(const char **)a, *(const char **)b);
}
int main() { int main() {
int max_students, num_accepted = 0, num_students = 0; char prihlasky[MAX_STUDENTS][MAX_LENGTH]; // Pole pre uloženie prihlášok
char names[MAX_STUDENTS][NAME_SIZE]; int max_prijati, pocet_prihlasek = 0;
char temp_name[NAME_SIZE];
scanf("%d", &max_students); // Načítanie maximálneho počtu študentov na prijatie
if (max_students <= 0 || max_students > MAX_STUDENTS) { if (scanf("%d", &max_prijati) != 1 || max_prijati <= 0) {
printf("Nespravny vstup\n"); printf("Nespravny vstup\n");
return 1; return 1;
} }
memset(names, 0, sizeof(names)); // Načítanie zoznamu prihlášok
while (scanf("%s", prihlasky[pocet_prihlasek]) == 1) {
while (fgets(temp_name, sizeof(temp_name), stdin)!= NULL && num_accepted < max_students) { pocet_prihlasek++;
temp_name[strcspn(temp_name, "\n")] = '\0';
int i, found = 0;
for (i = 0; i < num_accepted; i++) {
if (strcmp(names[i], temp_name) == 0) {
found = 1;
break;
}
}
if (!found) {
strcpy(names[num_accepted], temp_name);
num_accepted++;
}
num_students++;
} }
if (num_accepted == 0) { // Kontrola, či neboli načítané žiadne prihlášky
printf("Ziadne prihlasky"); if (pocet_prihlasek == 0) {
} else { printf("Ziadne prihlasky\n");
printf("Prijati studenti:"); return 1;
for (int i = 0; i < num_accepted; i++) { }
printf("%s\n", names[i]);
}
printf("%d1",num_accepted);
printf("%d2",num_students);
if (num_students > num_accepted) { // Zoradenie zoznamu prihlášok podľa abecedy
printf("Neprijati studenti:"); qsort(prihlasky, pocet_prihlasek, sizeof(prihlasky[0]), compare);
for (int i = 0; i < num_students; i++) {
strcpy(temp_name, names[i]); // Výber študentov na prijatie podľa abecedy a maximálneho počtu
int found = 0; printf("Prijati studenti:\n");
for (int j = 0; j < num_accepted; j++) { for (int i = 0; i < max_prijati && i < pocet_prihlasek; i++) {
if (strcmp(names[j], temp_name) == 0) { printf("%s\n", prihlasky[i]);
found = 1; }
break;
} // Výpis neprijatých študentov
} if (max_prijati < pocet_prihlasek) {
} printf("Neprijati studenti:\n");
for (int i = max_prijati; i < pocet_prihlasek; i++) {
printf("%s\n", prihlasky[i]);
} }
} }