92 lines
1.9 KiB
C
92 lines
1.9 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#define MAX_LENGTH 100
|
|
|
|
typedef struct Node {
|
|
char text[MAX_LENGTH];
|
|
struct Node *yes;
|
|
struct Node *no;
|
|
} Node;
|
|
|
|
Node* create_node(char *text) {
|
|
Node *new_node = (Node*)malloc(sizeof(Node));
|
|
strcpy(new_node->text, text);
|
|
new_node->yes = NULL;
|
|
new_node->no = NULL;
|
|
return new_node;
|
|
}
|
|
|
|
void free_tree(Node *node) {
|
|
if (node == NULL) return;
|
|
free_tree(node->yes);
|
|
free_tree(node->no);
|
|
free(node);
|
|
}
|
|
|
|
Node* load_knowledge_base() {
|
|
char line[MAX_LENGTH];
|
|
if (!fgets(line, MAX_LENGTH, stdin)) return NULL;
|
|
|
|
if (line[0] == '\n') return NULL;
|
|
|
|
// Создание узла
|
|
Node *node = create_node(line);
|
|
|
|
if (line[0] != '*') {
|
|
node->yes = load_knowledge_base();
|
|
node->no = load_knowledge_base();
|
|
}
|
|
return node;
|
|
}
|
|
|
|
int count_items(Node *node) {
|
|
if (node == NULL) return 0;
|
|
if (node->text[0] == '*') return 1;
|
|
return count_items(node->yes) + count_items(node->no);
|
|
}
|
|
|
|
void ask_question(Node *node) {
|
|
if (node == NULL) return;
|
|
|
|
printf("%s", node->text);
|
|
|
|
if (node->text[0] == '*') {
|
|
printf("Expert z bufetu to vie.\n");
|
|
return;
|
|
}
|
|
|
|
char answer;
|
|
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
|
|
if (scanf(" %c", &answer) != 1) {
|
|
printf("Neplatny vstup.\n");
|
|
return;
|
|
}
|
|
|
|
if (answer == 'a') {
|
|
ask_question(node->yes);
|
|
} else if (answer == 'n') {
|
|
ask_question(node->no);
|
|
} else {
|
|
printf("Neplatny vstup.\n");
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
Node *root = load_knowledge_base();
|
|
|
|
if (root == NULL) {
|
|
printf("Chyba pri nacitani bazy pravidiel.\n");
|
|
return 1;
|
|
}
|
|
|
|
int item_count = count_items(root);
|
|
printf("Pozna %d druhov ovocia a zeleniny.\n", item_count);
|
|
|
|
ask_question(root);
|
|
|
|
free_tree(root);
|
|
return 0;
|
|
}
|