Ofast -> O3

Author: adamant-pwn

verify/combi/binom.test.cpp

@@ -1,6 +1,6 @@
 // @brief Binomial Coefficient (Prime Mod)
 #define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #define CP_ALGO_MAXN 1e7
 #include "cp-algo/number_theory/modint.hpp"
 #include "cp-algo/math/combinatorics.hpp"

verify/combi/many_facts.test.cpp

@@ -1,6 +1,6 @@
 // @brief Many Factorials
 #define PROBLEM "https://judge.yosupo.jp/problem/many_factorials"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #define CP_ALGO_CHECKPOINT
 #include <bits/stdc++.h>
 #include "blazingio/blazingio.min.hpp"

verify/combi/many_facts_dynamic.test.cpp

@@ -1,6 +1,6 @@
 // @brief Many Factorials (dynamic Mod)
 #define PROBLEM "https://judge.yosupo.jp/problem/many_factorials"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #define CP_ALGO_CHECKPOINT
 #include <bits/stdc++.h>
 #include "blazingio/blazingio.min.hpp"

verify/geometry/arg.test.cpp

@@ -1,6 +1,6 @@
 // @brief Sort Points by Argument
 #define PROBLEM "https://judge.yosupo.jp/problem/sort_points_by_argument"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/geometry/point.hpp"
 #include <bits/stdc++.h>

verify/geometry/closest_pair.test.cpp

@@ -1,6 +1,6 @@
 // @brief Closest Pair of Points
 #define PROBLEM "https://judge.yosupo.jp/problem/closest_pair"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #include "cp-algo/geometry/closest_pair.hpp"
 #include <bits/stdc++.h>
 

verify/geometry/hull.test.cpp

@@ -1,6 +1,6 @@
 // @brief Static Convex Hull
 #define PROBLEM "https://judge.yosupo.jp/problem/static_convex_hull"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/geometry/convex_hull.hpp"
 #include <bits/stdc++.h>

verify/graph/2cc.test.cpp

@@ -1,6 +1,6 @@
 // @brief Two-Edge-Connected Components
 #define PROBLEM "https://judge.yosupo.jp/problem/two_edge_connected_components"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #include <iostream>
 #include "blazingio/blazingio.min.hpp"
 #include "cp-algo/graph/tarjan.hpp"

verify/graph/bcc.test.cpp

@@ -1,6 +1,6 @@
 // @brief Biconnected Components
 #define PROBLEM "https://judge.yosupo.jp/problem/biconnected_components"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #include <iostream>
 #include "blazingio/blazingio.min.hpp"
 #include "cp-algo/graph/tarjan.hpp"

verify/graph/cycle_directed.test.cpp

@@ -1,6 +1,6 @@
 // @brief Cycle Detection (Directed)
 #define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #include <bits/stdc++.h>
 #include "blazingio/blazingio.min.hpp"
 #include "cp-algo/graph/cycle.hpp"

verify/graph/cycle_undirected.test.cpp

@@ -1,6 +1,6 @@
 // @brief Cycle Detection (Undirected)
 #define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection_undirected"
-#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC optimize("O3,unroll-loops")
 #include "cp-algo/graph/cycle.hpp"
 #include <bits/stdc++.h>