revert 10000->10'000, fix macos-12-gpp, macos-13-gpp

Author: MikeMirzayanov

.github/workflows/ci.yml

@@ -180,7 +180,7 @@ jobs:
       matrix:
         os: [macos-12]
         compiler: [g++]
-        version: [11, 12, 13]
+        version: [12, 13, 14]
     name: Use ${{ matrix.compiler }}-${{ matrix.version }} on ${{ matrix.os }}
     runs-on: ${{ matrix.os }}
     steps:
@@ -209,7 +209,7 @@ jobs:
       matrix:
         os: [macos-13]
         compiler: [g++]
-        version: [11, 12, 13]
+        version: [12, 13, 14]
     name: Use ${{ matrix.compiler }}-${{ matrix.version }} on ${{ matrix.os }}
     runs-on: ${{ matrix.os }}
     steps:

generators/igen.cpp

@@ -13,5 +13,5 @@ using namespace std;
 int main(int argc, char *argv[]) {
     registerGen(argc, argv, 1);
 
-    println(rnd.next(1, 1'000'000));
+    println(rnd.next(1, 1000000));
 }

generators/iwgen.cpp

@@ -7,16 +7,16 @@
  *
  * If parameter "weight" > 0 then you can think about it as code like this:
  * <code>
- * result = rnd.next(1, 1'000'000);
+ * result = rnd.next(1, 1000000);
  * for (int i = 0; i < weight; i++)
- *     result = max(result, rnd.next(1, 1'000'000));
+ *     result = max(result, rnd.next(1, 1000000));
  * </code> 
  * 
  * If parameter "weight" < 0 then you can think about it as code like this:
  * <code>
- * result = rnd.next(1, 1'000'000);
+ * result = rnd.next(1, 1000000);
  * for (int i = 0; i < -weight; i++)
- *     result = min(result, rnd.next(1, 1'000'000));
+ *     result = min(result, rnd.next(1, 1000000));
  * </code> 
  *
  * It is typical behaviour of "wnext" methods to use this strategy to 
@@ -30,5 +30,5 @@ using namespace std;
 int main(int argc, char *argv[]) {
     registerGen(argc, argv, 1);
 
-    println(rnd.wnext(1, 1'000'000, opt<int>(1)));
+    println(rnd.wnext(1, 1000000, opt<int>(1)));
 }

tests/test-001_run-sval-case-nval/src/case-nval.cpp

@@ -17,7 +17,7 @@ int main(int argc, char *argv[]) {
 
     for (int testCase = 1; testCase <= testCaseCount; testCase++) {
         setTestCase(testCase);
-        int n = inf.readInt(1, 10'000, "n");
+        int n = inf.readInt(1, 10000, "n");
         inf.readEoln();
         inf.readInts(n, -1000, 1000, "a");
         inf.readEoln();

validators/case-nval.cpp

@@ -17,7 +17,7 @@ int main(int argc, char *argv[]) {
 
     for (int testCase = 1; testCase <= testCaseCount; testCase++) {
         setTestCase(testCase);
-        int n = inf.readInt(1, 10'000, "n");
+        int n = inf.readInt(1, 10000, "n");
         inf.readEoln();
         inf.readInts(n, -1000, 1000, "a");
         inf.readEoln();

validators/nval.cpp

@@ -11,10 +11,10 @@ using namespace std;
 int main(int argc, char *argv[]) {
     registerValidation(argc, argv);
 
-    int n = inf.readInt(1, 100'000, "n");
+    int n = inf.readInt(1, 100000, "n");
     inf.readEoln();
 
-    inf.readLongs(n, -1'000'000'000LL * 1'000'000LL, 1'000'000'000LL * 1'000'000LL, "a");
+    inf.readLongs(n, -1000000000LL * 1000000LL, 1000000000LL * 1000000LL, "a");
     inf.readEoln();
 
     inf.readEof();

validators/undirected-graph-validator.cpp

@@ -9,7 +9,7 @@ int main(int argc, char *argv[]) {
 
     int n = inf.readInt(1, 1000, "n");
     inf.readSpace();
-    int m = inf.readInt(0, 100'000, "m");
+    int m = inf.readInt(0, 100000, "m");
     inf.readEoln();
 
     set<pair<int, int>> edges;

validators/undirected-tree-validator.cpp

@@ -26,7 +26,7 @@ bool merge(vector<int> &dsu, int a, int b) {
 int main(int argc, char *argv[]) {
     registerValidation(argc, argv);
 
-    int n = inf.readInt(2, 100'000, "n");
+    int n = inf.readInt(2, 100000, "n");
     inf.readEoln();
 
     vector<int> dsu(n);