bk403nv/usaa24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

cv7

Browse Source
This commit is contained in:
Bohdan Kapliuk 2024-11-11 14:32:47 +02:00
parent ae9d9a9a08
commit 0b7175626f
1 changed files with 25 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
cv7/program.c
View File

@ -2,6 +2,7 @@
#include <stdio.h> #include <stdio.h>
#include <string.h> #include <string.h>
#include <assert.h> #include <assert.h>
#define SIZE 100 #define SIZE 100
struct tree { struct tree {
@ -10,17 +11,17 @@ struct tree {
struct tree* right; struct tree* right;
}; };
struct tree* read_tree(int* counter){ struct tree* read_tree(int* counter) {
char buffer[SIZE]; char buffer[SIZE];
memset(buffer, 0, SIZE); memset(buffer, 0, SIZE);
char* r = fgets(buffer, SIZE, stdin); char* r = fgets(buffer, SIZE, stdin);
if(buffer[0] == '\n'){ if (buffer[0] == '\n') {
return NULL; return NULL;
} }
assert(r); assert(r);
struct tree* tree = calloc(1, sizeof(struct tree)); struct tree* tree = calloc(1, sizeof(struct tree));
tree->value = malloc(strlen(buffer) + 1); tree->value = malloc(strlen(buffer) + 1);
strcpy(tree->value,r); strcpy(tree->value, buffer);
assert(tree->value); assert(tree->value);
if (buffer[0] == '*') { if (buffer[0] == '*') {
(*counter)++; (*counter)++;
@ -39,39 +40,37 @@ void destroy_tree(struct tree* tree) {
free(tree); free(tree);
} }
void print_tree(struct tree* tree,int offset){ void print_tree(struct tree* tree, int offset) {
char buffer[SIZE]; if (tree == NULL) return;
memset(buffer, 0, SIZE); for (int i = 0; i < offset && tree->value[0] != '*'; i++) {
for (int i = 0; i < offset && tree->value[0] != '*'; i++){
printf(" "); printf(" ");
} }
printf("%s",tree->value); printf("%s", tree->value);
if(tree->value[0] == '*'){ if (tree->value[0] == '*') {
printf("Koniec\n"); printf("Koniec vstupu\n");
exit(0); return;
} }
getchar();
char r = getchar(); char r = getchar();
if (r == 'a') { if (r == 'a') {
print_tree(tree->left, offset + 3); print_tree(tree->left, offset + 3);
} else if (r == 'n') { } else if (r == 'n') {
print_tree(tree->right, offset + 3); print_tree(tree->right, offset + 3);
} else if (r == '\n'){ } else if (r == '\n') {
printf("Koniec vstupu\n"); printf("Koniec vstupu\n");
}else { } else {
printf("Nerozumiem\n"); printf("Nerozumiem\n");
exit(0); exit(0);
} }
} }
int main(){ int main() {
int counter = 0; int counter = 0;
int offset = 0; int offset = 0;
struct tree* root = read_tree(&counter); struct tree* root = read_tree(&counter);
printf("Expert z bufetu to vie.\n"); printf("Expert z bufetu to vie.\n");
printf("Pozna %d druhov ovocia a zeleniny.\n",counter); printf("Pozna %d druhov ovocia a zeleniny.\n", counter);
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n"); printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
print_tree(root,offset); print_tree(root, offset);
destroy_tree(root); destroy_tree(root);
return 0; return 0;
} }