Modify C and C++ Testing (#5540)

* Update GCC to 15.2
* Reformat all C and C++ samples

Author: pascalecu

archive/c/c-plus-plus/binary-search.cpp

@@ -1,11 +1,14 @@
-#include <iostream>
 #include <bits/stdc++.h>
+#include <iostream>
 
 using namespace std;
 
 void handle_error()
 {
-    cout << "Usage: please provide a list of sorted integers (\"1, 4, 5, 11, 12\") and the integer to find (\"11\")" << endl;
+    cout
+        << "Usage: please provide a list of sorted integers (\"1, 4, 5, 11, "
+           "12\") and the integer to find (\"11\")"
+        << endl;
     exit(0);
 }
 
@@ -32,22 +35,16 @@ int check(string s)
     }
 
     for (int i = x1; i <= x2; i++)
-    {
         if (s[i] == ' ')
-        {
             handle_error();
-        }
-    }
 
     return stoi(s);
 }
 
 vector<int> convert(string s)
 {
     if (s.size() == 0)
-    {
         handle_error();
-    }
     vector<int> v;
     string num = "";
     for (int i = 0; i < s.size(); i++)
@@ -68,30 +65,22 @@ vector<int> convert(string s)
     }
 
     if (num.size() > 0)
-    {
         v.push_back(check(num));
-    }
 
     return v;
 }
 
 int main(int argc, char *argv[])
 {
     if (argc < 3)
-    {
         handle_error();
-    }
 
     vector<int> v = convert(argv[1]);
     int num = check(argv[2]);
 
     for (int i = 0; i < v.size() - 1; i++)
-    {
         if (v[i] > v[i + 1])
-        {
             handle_error();
-        }
-    }
 
     int start = 0, end = v.size();
     string ans = "false";
@@ -115,9 +104,7 @@ int main(int argc, char *argv[])
     }
 
     if (start > end)
-    {
         ans = "false";
-    }
 
     cout << ans << endl;
 }

archive/c/c-plus-plus/bubble-sort.cpp

@@ -28,23 +28,17 @@ void bubbleSort(std::vector<int> &v, int n)
         }
 
         if (swapped == false)
-        {
             break;
-        }
     }
 }
 
 void print(std::vector<int> v, int size)
 {
     for (int i = 0; i < size; i++)
         if (i == size - 1)
-        {
             std::cout << v[i] << std::endl;
-        }
         else
-        {
             std::cout << v[i] << ", ";
-        }
 }
 
 int main(int argc, char *argv[])
@@ -75,22 +69,19 @@ int main(int argc, char *argv[])
         if (commaSeparated == true)
         {
             for (int i = 0; i < strlen(characters); i++)
-            {
 
                 if (characters[i] != ',' && characters[i] != ' ')
-                {
                     numbers.push_back(atoi(&characters[i]));
-                }
-            }
         }
     }
 
     int size = numbers.size();
     if (size < 2)
     {
-        std::cout << "Usage: please provide a list of at least two integers to "
-                     "sort in the format \"1, 2, 3, 4, 5\""
-                  << std::endl;
+        std::cout
+            << "Usage: please provide a list of at least two integers to "
+               "sort in the format \"1, 2, 3, 4, 5\""
+            << std::endl;
     }
     else
     {

archive/c/c-plus-plus/capitalize.cpp

@@ -1,5 +1,5 @@
-#include <iostream>
 #include <cstring>
+#include <iostream>
 
 int main(int argc, const char *argv[])
 {
@@ -10,10 +10,8 @@ int main(int argc, const char *argv[])
     }
 
     for (int j = 0; j < (int)std::strlen(argv[1]); j++)
-    {
         if (j == 0)
             std::cout << (char)toupper(argv[1][j]);
         else
             std::cout << *(argv[1] + sizeof(char) * j);
-    }
 }

archive/c/c-plus-plus/convex-hull.cpp

@@ -17,9 +17,7 @@ struct Point
     bool operator<(const Point &other) const
     {
         if (x != other.x)
-        {
             return x < other.x;
-        }
         return y < other.y;
     }
 };
@@ -41,9 +39,7 @@ std::vector<int> parseList(const std::string &input)
     {
         auto start = token.find_first_not_of(" \t");
         if (start == std::string::npos)
-        {
             usage();
-        }
 
         const auto end = token.find_last_not_of(" \t");
         token = token.substr(start, end - start + 1);
@@ -57,9 +53,7 @@ std::vector<int> parseList(const std::string &input)
             const int value = std::stoi(token, &pos);
 
             if (pos != token.size())
-            {
                 usage();
-            }
 
             out.push_back(value);
         }
@@ -79,9 +73,7 @@ std::vector<Point> parseCoordinates(const std::string &xs,
     auto y = parseList(ys);
 
     if (x.size() != y.size() || x.size() < 3)
-    {
         usage();
-    }
 
     std::vector<Point> pts;
     pts.reserve(x.size());
@@ -100,9 +92,7 @@ long long cross(const Point &a, const Point &b, const Point &c)
 std::vector<Point> convexHull(std::vector<Point> pts)
 {
     if (pts.size() < 3)
-    {
         usage();
-    }
 
     std::sort(pts.begin(), pts.end());
 
@@ -115,8 +105,8 @@ std::vector<Point> convexHull(std::vector<Point> pts)
         {
             const auto &p = *it;
 
-            while (hull.size() >= 2 &&
-                   cross(hull[hull.size() - 2], hull.back(), p) <= 0)
+            while (hull.size() >= 2
+                   && cross(hull[hull.size() - 2], hull.back(), p) <= 0)
             {
                 hull.pop_back();
             }
@@ -140,14 +130,10 @@ std::vector<Point> convexHull(std::vector<Point> pts)
 int main(int argc, char *argv[])
 {
     if (argc != 3)
-    {
         usage();
-    }
 
     const auto hull = convexHull(parseCoordinates(argv[1], argv[2]));
 
     for (const auto &[x, y] : hull)
-    {
         std::cout << '(' << x << ", " << y << ")\n";
-    }
 }

archive/c/c-plus-plus/depth-first-search.cpp

@@ -7,7 +7,10 @@ vector<int> g[N];
 
 void handle_error()
 {
-    cout << "Usage: please provide a tree in an adjacency matrix form (\"0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0\") together with a list of vertex values (\"1, 3, 5, 2, 4\") and the integer to find (\"4\")\n";
+    cout << "Usage: please provide a tree in an adjacency matrix form (\"0, 1, "
+            "1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, "
+            "0\") together with a list of vertex values (\"1, 3, 5, 2, 4\") "
+            "and the integer to find (\"4\")\n";
     exit(0);
 }
 
@@ -34,12 +37,8 @@ int check(string s)
     }
 
     for (int i = x1; i <= x2; i++)
-    {
         if (s[i] == ' ')
-        {
             handle_error();
-        }
-    }
 
     return stoi(s);
 }
@@ -48,9 +47,7 @@ vector<int> convert(string s)
 {
 
     if (s.size() == 0)
-    {
         handle_error();
-    }
     vector<int> v;
     string num = "";
     for (int i = 0; i < s.size(); i++)
@@ -67,9 +64,7 @@ vector<int> convert(string s)
     }
 
     if (num.size() > 0)
-    {
         v.push_back(check(num));
-    }
 
     return v;
 }
@@ -95,7 +90,8 @@ int main(int argc, char *argv[])
     if (argc <= 1)
         handle_error();
 
-    vector<int> bin = convert(argv[1]), nodes = convert(argv[2]), t = convert(argv[3]);
+    vector<int> bin = convert(argv[1]), nodes = convert(argv[2]),
+                t = convert(argv[3]);
     if (bin.size() == 0 || nodes.size() == 0 || t.size() == 0)
         handle_error();
 
@@ -120,9 +116,11 @@ int main(int argc, char *argv[])
     int src = nodes[0];
     dfs(src);
     if (vis[t[0]])
-        cout << "true"
-             << "\n";
+        cout
+            << "true"
+            << "\n";
     else
-        cout << "false"
-             << "\n";
+        cout
+            << "false"
+            << "\n";
 }

archive/c/c-plus-plus/dijkstra.cpp

@@ -9,7 +9,8 @@ vector<int> dis(N, INT_MAX);
 
 void handle_error()
 {
-    cout << "Usage: please provide three inputs: a serialized matrix, a source node and a destination node";
+    cout << "Usage: please provide three inputs: a serialized matrix, a source "
+            "node and a destination node";
     exit(0);
 }
 
@@ -36,12 +37,8 @@ int check(string s)
     }
 
     for (int i = x1; i <= x2; i++)
-    {
         if (s[i] == ' ')
-        {
             handle_error();
-        }
-    }
 
     return stoi(s);
 }
@@ -50,9 +47,7 @@ vector<int> convert(string s)
 {
 
     if (s.size() == 0)
-    {
         handle_error();
-    }
     vector<int> v;
     string num = "";
     for (int i = 0; i < s.size(); i++)
@@ -113,7 +108,8 @@ int main(int argc, char *argv[])
 
     if (argc <= 1)
         handle_error();
-    vector<int> bin = convert(argv[1]), nodes = convert(argv[2]), t = convert(argv[3]);
+    vector<int> bin = convert(argv[1]), nodes = convert(argv[2]),
+                t = convert(argv[3]);
     if (bin.size() == 0 || nodes.size() == 0 || t.size() == 0)
         handle_error();
     int des = t[0];

archive/c/c-plus-plus/duplicate-character-counter.cpp

@@ -12,29 +12,19 @@ int main(int argc, char *argv[])
 {
 
     if (argc != 2)
-    {
         handle_error();
-    }
     string inputStr(argv[1]);
 
     if (inputStr.size() == 0)
-    {
         handle_error();
-    }
 
     unordered_map<char, int> m1;
 
     for (auto x : inputStr)
-    {
         if (m1.find(x) == m1.end())
-        {
             m1.insert({x, 1});
-        }
         else
-        {
             m1[x]++;
-        }
-    }
     int flag = 1;
     for (int i = 0; i < inputStr.length(); i++)
     {

archive/c/c-plus-plus/even-odd.cpp

@@ -6,21 +6,19 @@ using namespace std;
 
 int main(int argc, char **argv)
 {
-    if (argc == 1 || argv[1][0] == '\0' || (atoi(argv[1]) == 0 && strcmp(argv[1], "0") != 0))
+    if (argc == 1
+        || argv[1][0] == '\0'
+        || (atoi(argv[1]) == 0 && strcmp(argv[1], "0") != 0))
     {
         cout << "Usage: please input a number\n";
     }
     else
     {
         int input = atoi(argv[1]);
         if (input % 2 == 0)
-        {
             cout << "Even\n";
-        }
         else
-        {
             cout << "Odd\n";
-        }
     }
 
     return 0;