format

Author: lrvideckis

library/data_structures/uncommon/hilbert_mos.hpp

@@ -10,7 +10,7 @@
 //! @space O(1)
 ll hilbert(int x, int y) {
   ll d = 0, mx = 1;
-  while(mx <= max(x, y)) mx *= 4;
+  while (mx <= max(x, y)) mx *= 4;
   for (int s = mx / 2; s; s /= 2) {
     bool rx = x & s, ry = y & s;
     d = d * 4 | (ry * 3 ^ rx);

tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp

@@ -12,27 +12,23 @@ void test(int i, int j) {
   for (int k = 0; k < 4; k++) {
     int to_i = i + di[k];
     int to_j = j + dj[k];
-    if(to_i >= 0 && to_j >= 0) {
+    if (to_i >= 0 && to_j >= 0) {
       cnt_prev += (res - 1 == hilbert(to_i, to_j));
       cnt_next += (res + 1 == hilbert(to_i, to_j));
     }
   }
-  if(i==0 && j==0) assert(res == 0);
+  if (i == 0 && j == 0) assert(res == 0);
   else assert(cnt_prev == 1);
   assert(cnt_next == 1);
 }
-
 int main() {
   cin.tie(0)->sync_with_stdio(0);
-  for (int i = 0; i < 3000; i++) {
-    for (int j = 0; j < 3000; j++) {
-      test(i,j);
-    }
-  }
+  for (int i = 0; i < 3000; i++)
+    for (int j = 0; j < 3000; j++) test(i, j);
   for (int iter = 50000; iter--;) {
     int i = rnd(0, 1'000'000'000);
     int j = rnd(0, 1'000'000'000);
-    test(i,j);
+    test(i, j);
   }
   cout << "Hello World\n";
 }