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

cv3

Browse Source
This commit is contained in:
Bohdan Kapliuk 2024-10-12 15:42:30 +03:00
parent 34105f9bec
commit 3788c9731f
1 changed files with 100 additions and 57 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

157
cv3/program.c
View File

@ -1,71 +1,114 @@
#include <stdio.h> #include <stdio.h>
#include <string.h>
#include <stdlib.h> #include <stdlib.h>
#include <ctype.h> #include <string.h>
#include <assert.h>
#define STACK_SIZE 100 #define STACK_SIZE 10
#define INPUT_SIZE 100
struct stack{ // Štruktúra zásobníka
struct stack {
float values[STACK_SIZE]; float values[STACK_SIZE];
int size; int size;
}; };
int main(){ // Funkcia na vloženie hodnoty do zásobníka (push)
void push_stack(struct stack* s, float value) {
if (s->size >= STACK_SIZE) {
printf("Stack overflow error\n");
exit(1);
}
s->values[s->size] = value;
s->size += 1;
}
// Funkcia na výber hodnoty zo zásobníka (pop)
float pop_stack(struct stack* s) {
if (s->size <= 0) {
printf("Stack underflow error\n");
exit(1);
}
s->size -= 1;
return s->values[s->size];
}
// Funkcia na výpis zásobníka
void print_stack(struct stack* s) {
for (int i = 0; i < s->size; i++) {
printf("%.2f ", s->values[i]);
}
printf("\n");
}
// Funkcia na spracovanie operácií (+, -, *, /)
void perform_operation(struct stack* s, char op) {
if (s->size < 2) {
printf("Not enough values in the stack for operation\n");
exit(1);
}
float b = pop_stack(s);
float a = pop_stack(s);
float result;
switch (op) {
case '+':
result = a + b;
break;
case '-':
result = a - b;
break;
case '*':
result = a * b;
break;
case '/':
if (b == 0) {
printf("Division by zero error\n");
exit(1);
}
result = a / b;
break;
default:
printf("Unknown operator\n");
exit(1);
}
push_stack(s, result);
}
int main() {
struct stack mystack; struct stack mystack;
memset(&mystack,0,sizeof(struct stack)); mystack.size = 0;
char vstup[STACK_SIZE]; char input[INPUT_SIZE];
int counter = 0;
while(1){ while (1) {
fgets(vstup, STACK_SIZE, stdin); // Načítanie vstupu pomocou fgets
vstup[strcspn(vstup, "\n")] = 0; if (fgets(input, sizeof(input), stdin) == NULL) {
if(strlen(vstup) == 0){ printf("No input\n");
printf("no input");
return 0; return 0;
} }
if(vstup[0] == '-' || vstup[0] == '+' || vstup[0] == '*' || vstup[0] == '/'){
if(vstup[0] == '-'){ // Odstránenie nového riadku (ak existuje)
mystack.values[0] = mystack.values[0] - mystack.values[1]; input[strcspn(input, "\n")] = 0;
for(int i = 1; mystack.values[i] != 0;i++){
mystack.values[i] = mystack.values[i+1]; // Skúšame, či je vstup číslo
mystack.values[i+1] = 0; char *endptr;
counter--; float num = strtof(input, &endptr);
}
} if (endptr != input) {
if(vstup[0] == '/'){ // Je to číslo, pridáme ho do zásobníka
mystack.values[0] = mystack.values[0] / mystack.values[1]; push_stack(&mystack, num);
for(int i = 1; mystack.values[i] != 0;i++){ } else if (strlen(input) == 1 && (input[0] == '+' || input[0] == '-' || input[0] == '*' || input[0] == '/')) {
mystack.values[i] = mystack.values[i+1]; // Je to operácia, vykonáme ju
mystack.values[i+1] = 0; perform_operation(&mystack, input[0]);
counter--; } else {
} printf("no input\n");
} return 1;
if(vstup[0] == '*'){
mystack.values[0] = mystack.values[0] * mystack.values[1];
for(int i = 1; mystack.values[i] != 0;i++){
mystack.values[i] = mystack.values[i+1];
mystack.values[i+1] = 0;
counter--;
}
}
if(vstup[0] == '+'){
mystack.values[0] = mystack.values[0] + mystack.values[1];
for(int i = 1; mystack.values[i] != 0;i++){
mystack.values[i] = mystack.values[i+1];
mystack.values[i+1] = 0;
counter--;
}
}
}
else{
float cislo = strtof(vstup, NULL);
mystack.values[counter] = cislo;
counter++;
} }
mystack.size = counter;
for(int i =0; mystack.values[i] != 0;i++){ // Výpis zásobníka po každom úspešnom vstupe
printf("%.2f ", mystack.values[i]); print_stack(&mystack);
}
printf("\n");
} }
return 0;
} }