nits (#178)

* nits

* [auto-verifier] verify commit 9b0dd36

---------

Co-authored-by: GitHub <noreply@github.com>

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -25,7 +25,7 @@
 "tests/library_checker_aizu_tests/data_structures/implicit_seg_tree.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/kruskal_tree_aizu.test.cpp": "2026-01-18 02:20:40 +0000",
 "tests/library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp": "2026-01-18 11:15:41 +0000",
-"tests/library_checker_aizu_tests/data_structures/kth_smallest_wavelet_matrix.test.cpp": "2026-01-22 20:57:12 -0700",
+"tests/library_checker_aizu_tests/data_structures/kth_smallest_wavelet_matrix.test.cpp": "2026-02-03 09:18:52 -0700",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree.test.cpp": "2026-01-23 04:31:29 +0000",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_constructor.test.cpp": "2026-01-23 04:31:29 +0000",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc.test.cpp": "2026-01-23 04:31:29 +0000",
@@ -75,7 +75,7 @@
 "tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-08-06 16:18:37 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp": "2026-01-18 02:20:40 +0000",
 "tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2026-01-18 11:15:41 +0000",
-"tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2026-01-22 20:57:12 -0700",
+"tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2026-02-03 09:18:52 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/mobius.test.cpp": "2025-02-10 14:50:36 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/mod_division.test.cpp": "2025-09-07 16:12:35 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/n_choose_k.test.cpp": "2025-08-28 13:19:16 -0600",

library/data_structures_[l,r)/seg_tree_uncommon/wavelet_count_less.hpp

@@ -5,11 +5,11 @@
 int count(int l, int r, ll ub) {
   int res = 0;
   for (int h = sz(bv); h--;) {
-    int l0 = bv[h].cnt(l), r0 = bv[h].cnt(r);
-    if ((~ub >> h) & 1) l = l0, r = r0;
-    else
-      res += r0 - l0, l += bv[h].cnt(n) - l0,
-        r += bv[h].cnt(n) - r0;
+    int x = bv[h].cnt(l), y = bv[h].cnt(r);
+    if ((ub >> h) & 1)
+      res += y - x, l += bv[h].cnt(n) - x,
+        r += bv[h].cnt(n) - y;
+    else l = x, r = y;
   }
   return res;
 }

library/data_structures_[l,r)/seg_tree_uncommon/wavelet_matrix.hpp

@@ -25,11 +25,11 @@ struct wavelet_matrix {
   ll kth(int l, int r, int k) {
     ll res = 0;
     for (int h = sz(bv); h--;) {
-      int l0 = bv[h].cnt(l), r0 = bv[h].cnt(r);
-      if (k < r0 - l0) l = l0, r = r0;
+      int x = bv[h].cnt(l), y = bv[h].cnt(r);
+      if (k < y - x) l = x, r = y;
       else
-        k -= r0 - l0, res |= 1LL << h,
-          l += bv[h].cnt(n) - l0, r += bv[h].cnt(n) - r0;
+        k -= y - x, res += 1LL << h, l += bv[h].cnt(n) - x,
+          r += bv[h].cnt(n) - y;
     }
     return res;
   }