134 lines
3.8 KiB
C
134 lines
3.8 KiB
C
#include <stdlib.h>
|
|
#include <stdbool.h>
|
|
#include <stdio.h>
|
|
#include <ctype.h>
|
|
#include <string.h>
|
|
|
|
#define SIZE 128
|
|
|
|
//kontrola, ze ci vycitane informacie su aritmeticky spravne
|
|
//VRACIA: int: -1 (CHYBA), 0 (False), 1 (True)
|
|
float IsArithCorrect(float num1, float num2, char* op, float result)
|
|
{
|
|
|
|
switch (*op)
|
|
{
|
|
case '-':
|
|
if ((num1-num2) == result) { return 1;}
|
|
break;
|
|
|
|
case '+':
|
|
if ((num1+num2) == result) { return 1;}
|
|
break;
|
|
|
|
case '*':
|
|
if ((num1*num2) == result) { return 1;}
|
|
break;
|
|
|
|
case '/':
|
|
if (num2 == 0) { return -1;}
|
|
if ((num1/num2) == result ) { return 1;}
|
|
break;
|
|
}
|
|
return 0;
|
|
|
|
}
|
|
|
|
int main()
|
|
{
|
|
//pomocne premeny
|
|
char line[SIZE], strBuffer[SIZE];
|
|
line[0] = '\0';
|
|
strBuffer[0] = '\0';
|
|
char* strtofEndPtr;
|
|
|
|
|
|
|
|
while (fgets(line, SIZE, stdin) != NULL)
|
|
{
|
|
if (sscanf(line, "%127[^\n]", strBuffer) == 1)
|
|
{
|
|
bool isLineInvalid = false;
|
|
//docasne 'char' premeny
|
|
char num1Temp[10], num2Temp[10], resultTemp[10];
|
|
num1Temp[0] = '\0';
|
|
num2Temp[0] = '\0';
|
|
resultTemp[0] = '\0';
|
|
int writeIntoArrayNum = 1;
|
|
bool foundOp = false;
|
|
bool foundEqualSign = false;
|
|
|
|
char op1 = 'N'; //N = 'None/NIC'
|
|
|
|
for (int i = 0; strBuffer[i] != '\0'; i++)
|
|
{
|
|
else if (isspace() != 0)
|
|
{
|
|
continue;
|
|
}
|
|
else if (isdigit(strBuffer[i]) != 0 || strBuffer[i] == '.')
|
|
{
|
|
//cislo sa bude zapisovat podla toho, kde sme pri citani riadku...
|
|
//ak nenasiel ani arit. znamienko = cislo patri ku prvemu operandu (num1)
|
|
//ak nasiel arit. znamienko ale NIE este symbol '=', tak cislo patri ku druhemu operandu (num2)
|
|
//inak ak ma vsetko, tak zvysne nacitane cisla z riadku mozu byt vyluc. metodou len sucastou vysledku
|
|
if (op1 == 'N')
|
|
{
|
|
strncat(num1Temp, &strBuffer[i], 1);
|
|
}
|
|
else if (!foundEqualSign)
|
|
{
|
|
strncat(num1Temp, &strBuffer[i], 1);
|
|
}
|
|
else
|
|
{
|
|
strncat(resultTemp, &strBuffer[i], 1);
|
|
}
|
|
}
|
|
else if (strBuffer[i] == '=')
|
|
{
|
|
foundEqualSign = true;
|
|
continue;
|
|
}
|
|
|
|
else if (strBuffer[i] == '+' || strBuffer[i] == '-' || strBuffer[i] == '/' || strBuffer[i] == '*')
|
|
{
|
|
//predbezna kontrola, ze ci sme doteraz daco vobec nacitavali
|
|
if (op1 == 'N' || strBuffer[0] == '\0')
|
|
{
|
|
isLineInvalid = true;
|
|
}
|
|
op1 = strBuffer[i];
|
|
}
|
|
else
|
|
{
|
|
isLineInvalid = true;
|
|
break;
|
|
}
|
|
|
|
}
|
|
|
|
float num1 = strtof(num1Temp, &strtofEndPtr);
|
|
float num2 = strtof(num2Temp, &strtofEndPtr);
|
|
float resultNum = strtof(resultTemp, &strtofEndPtr);
|
|
|
|
//** konecna faza = vypisovanie vysledkov
|
|
|
|
//ak systematicka chyba
|
|
if (isLineInvalid || op1 == 'N' || IsArithCorrect(num1, num2, &op1, resultNum) == -1)
|
|
{
|
|
printf("CHYBA\n");
|
|
}
|
|
else if (IsArithCorrect(num1, num2, &op1, resultNum) == 0)
|
|
{
|
|
printf("ZLE\n");
|
|
}
|
|
else
|
|
{
|
|
printf("OK\n");
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|