Started with Codeforces educational round 118, finished a and b

codeforces/educational_rounds/118/a.cpp

@@ -0,0 +1,61 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void test_case(int tc){
+    int x, y, xZeroes, yZeroes;
+    cin >> x >> xZeroes >> y >> yZeroes;
+
+    int xLength = log10(x) + 1 + xZeroes;
+    int yLength = log10(y) + 1 + yZeroes;
+
+    if(xLength > yLength){
+        cout << ">\n";
+        return;
+    } else if(xLength < yLength){
+        cout << "<\n";
+        return;
+    }
+
+    int minZeroes = min(xZeroes, yZeroes);
+    xZeroes -= minZeroes;
+    yZeroes -= minZeroes;
+
+    double dx, dy;
+
+    if(x > y){
+        dx = (double)x / pow(10, yZeroes);
+        dy = y;
+    } else{
+        dx = x;
+        dy = (double)y / pow(10, xZeroes);
+    }
+
+    if(dx > dy){
+        cout << ">";
+    } else if(dx < dy){
+        cout << "<";
+    } else{
+        cout << "=";
+    } cout << "\n";
+
+    return;
+}
+
+
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int t;
+    cin >> t;
+
+    for(int tc = 1; tc <= t; ++tc){
+        test_case(tc);
+    }
+
+    cout << flush;
+
+    return 0;
+}

codeforces/educational_rounds/118/b.cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void test_case(int tc){
+    int n;
+    cin >> n;
+
+    vector<int> seq(n);
+
+    for(int i = 0; i < n; ++i){
+        cin >> seq[i];
+    }
+
+    sort(seq.begin(), seq.end());
+
+    for(int i = 1; i < n / 2 + 1; ++i){
+        cout << seq[i] << " " << seq[0] << "\n";
+    }
+
+}
+
+
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int t;
+    cin >> t;
+
+    for(int tc = 1; tc <= t; ++tc){
+        test_case(tc);
+    }
+
+    cout << flush;
+
+    return 0;
+}

codeforces/educational_rounds/118/c.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void test_case(int tc){
+
+}
+
+
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int t;
+    cin >> t;
+
+    for(int tc = 1; tc <= t; ++tc){
+        test_case(tc);
+    }
+
+    cout << flush;
+
+    return 0;
+}

codeforces/educational_rounds/118/d.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void test_case(int tc){
+
+}
+
+
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int t;
+    cin >> t;
+
+    for(int tc = 1; tc <= t; ++tc){
+        test_case(tc);
+    }
+
+    cout << flush;
+
+    return 0;
+}

codeforces/educational_rounds/118/e.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void test_case(int tc){
+
+}
+
+
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int t;
+    cin >> t;
+
+    for(int tc = 1; tc <= t; ++tc){
+        test_case(tc);
+    }
+
+    cout << flush;
+
+    return 0;
+}

codeforces/educational_rounds/118/f.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void test_case(int tc){
+
+}
+
+
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int t;
+    cin >> t;
+
+    for(int tc = 1; tc <= t; ++tc){
+        test_case(tc);
+    }
+
+    cout << flush;
+
+    return 0;
+}