dl511ir/usaa25
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

12dsd

Browse Source
This commit is contained in:
Denis Landa 2025-11-20 21:45:05 +01:00
parent c43329801b
commit 5bc6b97f31
1 changed files with 62 additions and 53 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

115
du6/program.c
View File

@ -2,93 +2,102 @@
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#define VELKOST 256 #define SIZE 256
struct Uzol{ struct tree {
char text[VELKOST]; char text[SIZE];
struct Uzol* ano; struct tree* yes;
struct Uzol* nie; struct tree* no;
}; };
struct Uzol* nacitaj_uzol(){ int count_items = 0;
char riadok[VELKOST];
if(!fgets(riadok, VELKOST, stdin)) struct tree* read_tree() {
char buffer[SIZE];
if (!fgets(buffer, SIZE, stdin))
return NULL; return NULL;
if(riadok[0] == '\n') if (buffer[0] == '\n')
return NULL; return NULL;
struct Uzol* u = malloc(sizeof(struct Uzol)); struct tree* node = malloc(sizeof(struct tree));
strcpy(u->text, riadok); strcpy(node->text, buffer);
u->ano = NULL; node->yes = NULL;
u->nie = NULL; node->no = NULL;
if(riadok[0] == '*'){ if (buffer[0] == '*') {
return u; count_items++;
return node;
} }
u->ano = nacitaj_uzol(); node->yes = read_tree();
u->nie = nacitaj_uzol(); if (!node->yes) {
return u; printf("Chyba\n");
exit(0);
}
node->no = read_tree();
if (!node->no) {
printf("Chyba\n");
exit(0);
}
return node;
} }
void zrus_strom(struct Uzol* u){ void destroy_tree(struct tree* t) {
if(!u) return; if (!t) return;
zrus_strom(u->ano); destroy_tree(t->yes);
zrus_strom(u->nie); destroy_tree(t->no);
free(u); free(t);
} }
int pocet_tovarov(struct Uzol* u){ void run(struct tree* t) {
if(!u) return 0; printf("%s", t->text);
if(u->text[0] == '*') return 1;
return pocet_tovarov(u->ano) + pocet_tovarov(u->nie);
}
void spusti_system(struct Uzol* u){ if (t->text[0] == '*') {
if(u->text[0] == '*'){
printf("%s", u->text);
printf("Koniec\n"); printf("Koniec\n");
return; return;
} }
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n"); printf("Odpovedajte 'a' alebo 'n'\n");
printf("%s", u->text);
char c; char c;
if(scanf(" %c", &c) != 1){ if (scanf(" %c", &c) != 1) {
printf("Koniec vstupu\n"); printf("Chyba\n");
return; return;
} }
if(c == 'a'){ if (c == 'a')
spusti_system(u->ano); run(t->yes);
} else if (c == 'n')
else if(c == 'n'){ run(t->no);
spusti_system(u->nie); else
} printf("Chyba\n");
else{
printf("Nerozumiem\n");
}
} }
int main(){ int main() {
struct Uzol* koren = nacitaj_uzol(); struct tree* root = read_tree();
if(!koren){ if (!root) {
printf("Chyba: nepodarilo sa nacitat bazu pravidiel.\n"); printf("Chyba\n");
return 0; return 0;
} }
int pocet = pocet_tovarov(koren); char line[SIZE];
if (!fgets(line, SIZE, stdin) || line[0] != '\n') {
printf("Chyba\n");
destroy_tree(root);
return 0;
}
printf("Expert z bufetu to vie.\n"); printf("MUDrC to vie.\n");
printf("Pozna %d druhov ovocia a zeleniny.\n", pocet); printf("Pozna %d druhov ovocia a zeleniny.\n", count_items);
spusti_system(koren); run(root);
zrus_strom(koren);
destroy_tree(root);
return 0; return 0;
} }