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

oprava asi

Browse Source
This commit is contained in:
Michal Utľák 2024-04-22 17:28:29 +02:00
parent d805500070
commit ccf621bbd2
1 changed files with 19 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
cv10/program.c
View File

@ -3,39 +3,32 @@
#include <string.h> #include <string.h>
int main() { int main() {
int pocet;
char pole[100][100]; char pole[100][100];
int pocet_studentov = 0; int pocet_studentov = 0;
int ziadne_mena = 1; int ziadne_mena = 1;
while (fgets(pole[pocet_studentov], sizeof(pole[pocet_studentov]), stdin) != NULL) { char first_input[100];
if (sscanf(pole[pocet_studentov], "%d", &pocet) == 1 && pocet > 0) { if (fgets(first_input, sizeof(first_input), stdin) == NULL) {
ziadne_mena = 0;
break;
}
printf("Nespravny vstup\n"); printf("Nespravny vstup\n");
return 1; return 1;
} }
while (fgets(pole[pocet_studentov], sizeof(pole[pocet_studentov]), stdin) != NULL) {
if (pole[pocet_studentov][0] == '\n') {
break;
}
ziadne_mena = 0;
pole[pocet_studentov][strcspn(pole[pocet_studentov], "\n")] = '\0';
pocet_studentov++;
}
if (ziadne_mena) { if (ziadne_mena) {
printf("Ziadne prihlasky\n"); printf("Ziadne prihlasky\n");
return 1; return 1;
} }
pocet_studentov++;
while (pocet_studentov < 100 && fgets(pole[pocet_studentov], sizeof(pole[pocet_studentov]), stdin) != NULL) { for (int i = 0; i < pocet_studentov - 1; i++) {
pole[pocet_studentov][strcspn(pole[pocet_studentov], "\n")] = '\0';
pocet_studentov++;
}
if (pocet_studentov == 1) {
printf("Ziadne prihlasky\n");
return 1;
}
for (int i = 1; i < pocet_studentov - 1; i++) {
for (int j = i + 1; j < pocet_studentov; j++) { for (int j = i + 1; j < pocet_studentov; j++) {
if (strcmp(pole[i], pole[j]) > 0) { if (strcmp(pole[i], pole[j]) > 0) {
char temp[100]; char temp[100];
@ -47,13 +40,16 @@ int main() {
} }
printf("Prijati studenti:\n"); printf("Prijati studenti:\n");
for (int i = 1; i <= pocet && i < pocet_studentov; i++) { int pocet = atoi(first_input);
for (int i = 0; i < pocet && i < pocet_studentov; i++) {
printf("%s\n", pole[i]); printf("%s\n", pole[i]);
} }
printf("Neprijati studenti:\n"); if (pocet < pocet_studentov) {
for (int i = pocet + 1; i < pocet_studentov; i++) { printf("Neprijati studenti:\n");
printf("%s\n", pole[i]); for (int i = pocet; i < pocet_studentov; i++) {
printf("%s\n", pole[i]);
}
} }
return 0; return 0;