usaa24/cv3/program.c

119 lines
2.7 KiB
C
Raw Normal View History

2024-10-16 07:53:15 +00:00
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#define STACK_SIZE 10
float stack[STACK_SIZE];
int stack_top = -1;
bool is_number(char *string) {
char *end;
strtof(string, &end);
2024-10-16 08:07:34 +00:00
return end != string && *end == '\n';
2024-10-16 07:53:15 +00:00
}
2024-10-16 08:01:39 +00:00
bool is_operation(char *string) {
return strlen(string) == 2 && (string[0] == '+' || string[0] == '-' || string[0] == '*' || string[0] == '/');
2024-10-16 07:53:15 +00:00
}
float calculator(float n1, float n2, char operation) {
if (operation == '+') {
return n1 + n2;
}
else if (operation == '-') {
return n1 - n2;
}
else if (operation == '*') {
return n1 * n2;
}
else if (operation == '/') {
if (n2 != 0) {
return n1 / n2;
} else {
2024-10-16 08:01:39 +00:00
printf("Error: division by zero\n");
2024-10-16 08:07:34 +00:00
return 0;
2024-10-16 07:53:15 +00:00
}
}
return 0;
}
2024-10-16 08:01:39 +00:00
2024-10-16 07:53:15 +00:00
void push(float number) {
if (stack_top < STACK_SIZE - 1) {
stack[++stack_top] = number;
} else {
2024-10-16 08:01:39 +00:00
printf("Error: stack overflow\n");
2024-10-16 07:53:15 +00:00
}
}
2024-10-16 08:01:39 +00:00
2024-10-16 07:53:15 +00:00
float pop() {
if (stack_top >= 0) {
return stack[stack_top--];
} else {
2024-10-16 08:01:39 +00:00
printf("Error: stack is empty\n");
2024-10-16 08:07:34 +00:00
return 0;
2024-10-16 07:53:15 +00:00
}
}
int main() {
char arr[50];
char *pend;
stack_top = -1;
2024-10-16 08:12:58 +00:00
bool first_output = true;
2024-10-16 08:15:24 +00:00
bool operation_successful = true;
2024-10-16 07:53:15 +00:00
while (fgets(arr, 50, stdin)) {
if (arr[0] == '\n' || arr[0] == EOF) {
break;
}
2024-10-16 08:01:39 +00:00
2024-10-16 07:53:15 +00:00
if (is_number(arr)) {
float number = strtof(arr, &pend);
push(number);
2024-10-16 08:12:58 +00:00
if (!first_output) {
printf(" ");
}
printf("%.2f", number);
first_output = false;
2024-10-16 08:15:24 +00:00
operation_successful = true;
2024-10-16 07:53:15 +00:00
}
2024-10-16 08:01:39 +00:00
else if (is_operation(arr)) {
2024-10-16 07:53:15 +00:00
if (stack_top < 1) {
2024-10-16 08:12:58 +00:00
if (!first_output) {
2024-10-16 08:18:57 +00:00
printf("\n");
2024-10-16 08:12:58 +00:00
}
2024-10-16 08:18:57 +00:00
printf("no input\n");
return 0; // Завершение программы при ошибке
2024-10-16 07:53:15 +00:00
}
2024-10-16 08:01:39 +00:00
2024-10-16 07:53:15 +00:00
float n2 = pop();
float n1 = pop();
char operation = arr[0];
float result = calculator(n1, n2, operation);
push(result);
2024-10-16 08:12:58 +00:00
if (!first_output) {
printf(" ");
}
2024-10-16 08:18:57 +00:00
printf("%.2f\n", result);
first_output = true; // Ожидаем новый ввод на новой строке
2024-10-16 07:53:15 +00:00
}
else {
2024-10-16 08:12:58 +00:00
if (!first_output) {
2024-10-16 08:18:57 +00:00
printf("\n");
2024-10-16 08:12:58 +00:00
}
2024-10-16 08:18:57 +00:00
printf("no input\n");
return 0; // Завершение программы при ошибке
2024-10-16 07:53:15 +00:00
}
}
2024-10-16 08:18:57 +00:00
if (stack_top == 0) {
printf("%.2f\n", pop());
} else {
printf("no input\n");
2024-10-16 07:53:15 +00:00
}
return 0;
}