library: use >> 1 instead of / 2 for non-negative halving repo-wide

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) / 2;
+    int mid_res = (res_le + res_ri) >> 1;
     int op_arb = arb_le;
     rep(i, arb_le, min(mid_res + 1, arb_ri)) {
       int j = mid_res - i;

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 / 2;
+  int mid = n >> 1;
   auto rect_left =
     divide_and_conquer(vl(begin(h), begin(h) + mid),
       vl(begin(bottom), begin(bottom) + mid));

library/math/tetration_mod.hpp

@@ -13,7 +13,7 @@
 ll bin_exp(ll b, ll e, int mod) {
   ll res = 1;
   if ((b %= mod) < 0) b += mod;
-  for (; e; b = b * b % mod, e /= 2)
+  for (; e; b = b * b % mod, e >>= 1)
     if (e & 1) res = res * b % mod;
   return res;
 }

library/strings/binary_trie.hpp

@@ -18,7 +18,7 @@ struct binary_trie {
   binary_trie(): t(1) {}
   void update(ll num, int delta) {
     int v = 0;
-    for (ll bit = mx_bit; bit; bit /= 2) {
+    for (ll bit = mx_bit; bit; bit >>= 1) {
       bool b = num & bit;
       if (t[v].nxt[b] == -1) {
         t[v].nxt[b] = sz(t);
@@ -31,7 +31,7 @@ struct binary_trie {
   ll walk(ll num) {
     int v = 0;
     ll res = 0;
-    for (ll bit = mx_bit; bit; bit /= 2) {
+    for (ll bit = mx_bit; bit; bit >>= 1) {
       bool b = num & bit;
       int u = t[v].nxt[b];
       if (u != -1 && t[u].siz > 0) v = u, res |= num & bit;

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) / 2;
+  int n = (sz(pq.man) + 1) >> 1;
   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) / 2, pal_len};
+    return {(best_center + 1 - pal_len) >> 1, 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 / 2;
+              : i >> 1;
     man[i] = i - r;
     while (
       man[i] > 0 && r + 1 < n && s[man[i] - 1] == s[r + 1])

library/trees/uncommon/linear_kth_par.hpp

@@ -50,7 +50,7 @@ struct linear_kth_par {
     assert(0 <= k && k <= d[u]);
     if (k == 0) return u;
     int anc_d = d[u] - k, bc = bit_ceil(k + 0u);
-    int t = (tin[u] + bc / 2) & -bc;
+    int t = (tin[u] + (bc >> 1)) & -bc;
     int i =
       idx[jmp[t].at(bit_width((d_tour[t] - anc_d) / 2u))];
     return lad[i + d[lad[i]] - anc_d];