Initial commit

2022/city/12/expresii/expresii.cpp

@@ -0,0 +1,96 @@
+#include <fstream>
+#include <deque>
+#include <unordered_map>
+using namespace std;
+
+ifstream input_stream;
+ofstream output_stream;
+unordered_map<char, int> numbers_map = {{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}};
+
+
+int64_t evaluateNum(string num) {
+    int64_t res = 0;
+    const int lim = num.length();
+
+
+    for (int i = 0; i < lim - 1; i++) {
+        if (numbers_map[num[i]] >= numbers_map[num[i + 1]]) {
+            res += numbers_map[num[i]];
+        } else {
+            res -= numbers_map[num[i]];
+        }
+    }
+    res += numbers_map[num[lim - 1]];
+
+    return res;
+}
+
+
+
+int main() {
+    input_stream.open("expresii.in");
+    output_stream.open("expresii.out");
+
+    string expression;
+    input_stream >> expression;
+
+    deque<int64_t> numbers;
+    deque<char> operations;
+
+    string currNumber = "";
+    const int lim = expression.length();
+    for (int i = 0; i < lim; i++) {
+        if (numbers_map[expression[i]] > 0) {
+            currNumber += expression[i];
+        } else {
+            numbers.push_back(evaluateNum(currNumber));
+            operations.push_back(expression[i]);
+            currNumber = "";
+        }
+    }
+    numbers.push_back(evaluateNum(currNumber));
+
+
+    // Evaluate multiplications
+    int pos = 0;
+    for (auto it = operations.begin(); it != operations.end(); it++) {
+        if (*it == '*') {
+            auto num1 = numbers.begin();
+            advance(num1, pos);
+            auto num2 = numbers.begin();
+            advance(num2, pos + 1);
+
+            *num1 = *num2 * *num1;
+            numbers.erase(num2);
+            pos--;
+        }
+        pos++;
+    }
+
+
+    // Evaluate other stuff
+    pos = 0;
+    int64_t res = numbers.front();
+    for (auto it = operations.begin(); it != operations.end(); it++) {
+        if (*it == '*') {
+            continue;
+        }
+
+        auto num = numbers.begin();
+        advance(num, pos + 1);
+
+        if (*it == '+') {
+            res += *num;
+        } else {
+            res -= *num;
+        }
+
+        pos++;
+    }
+
+    output_stream << res << endl;
+
+    input_stream.close();
+    output_stream.close();
+    return 0;
+}

2022/city/12/expresii/tests/1-expresii.in

@@ -0,0 +1,3 @@
+XIV*MMCIX-MMXXII+V*XL-CDXLIV
+
+

2022/city/12/expresii/tests/1-expresii.ok

@@ -0,0 +1 @@
+27260

2022/city/12/expresii/tests/10-expresii.in

@@ -0,0 +1 @@
+CCXXXIX+MDLVIII-MCMXLIX*MMMMCDXXXIV+DLXXXIX+MMMMCDXLIX*MMXXXVIII-MDLXIX*CDXCIX-MMMMMMCDXLIV

2022/city/12/expresii/tests/10-expresii.ok

@@ -0,0 +1 @@
+-361793

2022/city/12/expresii/tests/2-expresii.in

@@ -0,0 +1,3 @@
+I+V-VI*VII-VIII+IX-X+II-III+IV*X
+
+

2022/city/12/expresii/tests/2-expresii.ok

@@ -0,0 +1 @@
+-6

2022/city/12/expresii/tests/3-expresii.in

@@ -0,0 +1,4 @@
+I*V-VI-VII+VIII+IX-X-II-III*IV*X-M
+
+
+

2022/city/12/expresii/tests/3-expresii.ok

@@ -0,0 +1 @@
+-1123

2022/city/12/expresii/tests/4-expresii.in

@@ -0,0 +1 @@
+XXXI+XXXII-XXXIII+XXXVII*XXXVIII+XXXIX+XL+XXXIV*XXXV+XXXVI

2022/city/12/expresii/tests/4-expresii.ok

@@ -0,0 +1 @@
+2741

2022/city/12/expresii/tests/5-expresii.in

@@ -0,0 +1 @@
+XXXI*XXXII+XXXIII+XXXVII-XXXVIII*XXXIX+XL+XXXIV-XXXV*XXXVI

2022/city/12/expresii/tests/5-expresii.ok

@@ -0,0 +1 @@
+-1606

2022/city/12/expresii/tests/6-expresii.in

@@ -0,0 +1,2 @@
+MMMMMMCDXLIV
+

2022/city/12/expresii/tests/6-expresii.ok

@@ -0,0 +1 @@
+6444

2022/city/12/expresii/tests/7-expresii.in

@@ -0,0 +1 @@
+D

2022/city/12/expresii/tests/7-expresii.ok

@@ -0,0 +1 @@
+500

2022/city/12/expresii/tests/8-expresii.in

@@ -0,0 +1,2 @@
+LXIV+MXCVII*MDCVIII*DCCCLXIV-CMLXIX+MCDLXV-MMDCCCXCVII*XCIX+CDXLIV
+

2022/city/12/expresii/tests/8-expresii.ok

@@ -0,0 +1 @@
+1523789465

2022/city/12/expresii/tests/9-expresii.in

@@ -0,0 +1 @@
+CCXLIX-CMXCIX*DLXXXIV-MXCVIII-XXVI*LXII-CLXXXIV-MMMXLI+MMMCCXLIX

2022/city/12/expresii/tests/9-expresii.ok

@@ -0,0 +1 @@
+-585853

2022/city/12/expresii/tests/teste.txt

@@ -0,0 +1,10 @@
+1
+2
+3
+4
+5
+6
+7
+8
+9
+10