decrease bound

Author: lrvideckis

library/math/prime_sieve/mobius.hpp

@@ -1,7 +1,7 @@
 #pragma once
 //! @time O(mx log mx)
 //! @space O(mx)
-vi mobius(1'000'005);
+vi mobius(100'005);
 mobius[1] = 1;
 rep(i, 1, sz(mobius)) for (int j = i + i; j < sz(mobius);
                            j += i) mobius[j] -= mobius[i];

tests/library_checker_aizu_tests/handmade_tests/mobius.test.cpp

@@ -5,7 +5,6 @@
 int main() {
   cin.tie(0)->sync_with_stdio(0);
 #include "../../../library/math/prime_sieve/mobius.hpp"
-#include "../../../library/math/prime_sieve/calc_sieve.hpp"
 #include "../../../library/math/prime_sieve/is_prime.hpp"
   assert(is_prime(2));
   for (int i = 1; i < sz(mobius); i++) {