use / 2 for arithmetic halving, keep >> 1 for bit manipulation

Author: cameroncuster

library/convolution/min_plus_convolution_convex_and_arbitrary.hpp

@@ -12,7 +12,7 @@ vi min_plus(const vi& convex, const vi& arbitrary) {
   auto dnc = [&](this auto&& dnc, int res_le, int res_ri,
                int arb_le, int arb_ri) {
     if (res_le >= res_ri) return;
-    int mid_res = (res_le + res_ri) >> 1;
+    int mid_res = (res_le + res_ri) / 2;
     int op_arb = arb_le;
     rep(i, arb_le, min(mid_res + 1, arb_ri)) {
       int j = mid_res - i;

library/data_structures_[l,r)/seg_tree_midpoint.hpp

@@ -2,5 +2,5 @@
 //! https://codeforces.com/blog/entry/112755
 int split(int tl, int tr) {
   int pw2 = bit_floor(tr - tl + 0u);
-  return min(tl + pw2, tr - (pw2 >> 1));
+  return min(tl + pw2, tr - pw2 / 2);
 }

library/data_structures_[l,r)/uncommon/deque_op.hpp

@@ -10,7 +10,7 @@ template<class T, class F> struct deq {
   F op;
   vector<dt> l, r;
   deq(const vector<T>& a, F op): op(op) {
-    rebuild(a, sz(a) >> 1);
+    rebuild(a, sz(a) / 2);
   }
   T query() {
     if (empty(l)) return r.back()[1];
@@ -33,7 +33,7 @@ template<class T, class F> struct deq {
       vector<T> a(sz(l));
       ranges::transform(l, rbegin(a),
         [](dt& x) { return x[0]; });
-      rebuild(a, sz(a) >> 1);
+      rebuild(a, sz(a) / 2);
     }
     r.pop_back();
   }
@@ -46,7 +46,7 @@ template<class T, class F> struct deq {
       vector<T> a(sz(r));
       ranges::transform(r, begin(a),
         [](dt& x) { return x[0]; });
-      rebuild(a, (sz(a) + 1) >> 1);
+      rebuild(a, (sz(a) + 1) / 2);
     }
     l.pop_back();
   }

library/data_structures_[l,r]/seg_tree_midpoint.hpp

@@ -6,5 +6,5 @@
 //! @endcode
 int split(int tl, int tr) {
   int pw2 = bit_floor(tr - tl + 1u);
-  return min(tl + pw2 - 1, tr - (pw2 >> 1));
+  return min(tl + pw2 - 1, tr - pw2 / 2);
 }

library/math/count_paths/count_paths_triangle.hpp

@@ -15,7 +15,7 @@ vl divide_and_conquer(vl h, vl bottom) {
   int n = sz(h);
   if (n == 0) return {};
   if (n == 1) return vl(h[0], bottom[0]);
-  int mid = n >> 1;
+  int mid = n / 2;
   auto rect_left =
     divide_and_conquer(vl(begin(h), begin(h) + mid),
       vl(begin(bottom), begin(bottom) + mid));

library/strings/manacher/longest_from_index.hpp

@@ -9,7 +9,7 @@
 //! @time O(n)
 //! @space O(n)
 vi longest_from_index(pal_query& pq) {
-  int n = (sz(pq.man) + 1) >> 1;
+  int n = (sz(pq.man) + 1) / 2;
   vector longest(n, n - 1);
   for (int i = n - 2; i >= 0; i--) {
     longest[i] = min(longest[i + 1] + 1, n - 1);

library/strings/manacher/longest_palindrome_query.hpp

@@ -52,6 +52,6 @@ struct longest_pal_query {
       });
     int best_center =
       rmq.query(2 * l + pal_len - 1, 2 * r - pal_len);
-    return {(best_center + 1 - pal_len) >> 1, pal_len};
+    return {(best_center + 1 - pal_len) / 2, pal_len};
   }
 };

library/strings/manacher/manacher.hpp

@@ -22,7 +22,7 @@ vi manacher(const auto& s) {
   rep(i, 0, 2 * n - 1) {
     int r = i <= 2 * (p - man[p])
               ? p - max(man[2 * p - i], man[p])
-              : i >> 1;
+              : i / 2;
     man[i] = i - r;
     while (
       man[i] > 0 && r + 1 < n && s[man[i] - 1] == s[r + 1])

tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp

@@ -22,7 +22,7 @@ int main() {
   auto get_compressed_idx = [&](int val) -> int {
     int l = 0, r = sz(compress);
     while (l + 1 < r) {
-      int m = (l + r) >> 1;
+      int m = (l + r) / 2;
       if (compress[m] <= val) l = m;
       else r = m;
     }

tests/library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp

@@ -14,7 +14,7 @@ int main() {
   for (int& val : arr) {
     int start = 0, end = sz(sorted);
     while (start + 1 < end) {
-      int mid = (start + end) >> 1;
+      int mid = (start + end) / 2;
       if (sorted[mid] <= val) start = mid;
       else end = mid;
     }