[auto-verifier] docs commit ac1a6e0

Author: web-flow

index.md

@@ -1,6 +1,14 @@
 ---
 data:
   libraryCategories:
+  - name: weilycoder
+    pages:
+    - icon: ':heavy_check_mark:'
+      path: weilycoder/const_rand.hpp
+      title: Linear Congruential Generator (LCG) to produce pseudo-random numbers
+    - icon: ':heavy_check_mark:'
+      path: weilycoder/fast-io.hpp
+      title: Fast Input/Output Utilities
   - name: weilycoder/ds
     pages:
     - icon: ':heavy_check_mark:'
@@ -21,11 +29,6 @@ data:
     - icon: ':heavy_check_mark:'
       path: weilycoder/ds/unionfind.hpp
       title: Union-Find (Disjoint Set Union) Data Structure
-  - name: weilycoder
-    pages:
-    - icon: ':heavy_check_mark:'
-      path: weilycoder/fast-io.hpp
-      title: Fast Input/Output Utilities
   - name: weilycoder/graph
     pages:
     - icon: ':heavy_check_mark:'
@@ -59,6 +62,12 @@ data:
     - icon: ':heavy_check_mark:'
       path: weilycoder/poly/karatsuba.hpp
       title: Multiply two polynomials using the Karatsuba algorithm.
+    - icon: ':heavy_check_mark:'
+      path: weilycoder/poly/ntt.hpp
+      title: Number Theoretic Transform (NTT)
+    - icon: ':heavy_check_mark:'
+      path: weilycoder/poly/ntt_convolve.hpp
+      title: weilycoder/poly/ntt_convolve.hpp
   verificationCategories:
   - name: test
     pages:
@@ -68,6 +77,9 @@ data:
     - icon: ':heavy_check_mark:'
       path: test/biconnected_components.test.cpp
       title: test/biconnected_components.test.cpp
+    - icon: ':heavy_check_mark:'
+      path: test/convolution_mod.test.cpp
+      title: test/convolution_mod.test.cpp
     - icon: ':heavy_check_mark:'
       path: test/convolution_mod_2_64.test.cpp
       title: test/convolution_mod_2_64.test.cpp

test/aplusb.test.cpp.md

@@ -160,7 +160,7 @@ data:
   isVerificationFile: true
   path: test/aplusb.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/aplusb.test.cpp

test/biconnected_components.test.cpp.md

@@ -112,7 +112,7 @@ data:
   isVerificationFile: true
   path: test/biconnected_components.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/biconnected_components.test.cpp

test/convolution_mod.test.cpp.md

@@ -95,7 +95,7 @@ data:
   isVerificationFile: true
   path: test/convolution_mod_2_64.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/convolution_mod_2_64.test.cpp

test/convolution_mod_2_64.test.cpp.md

@@ -162,7 +162,7 @@ data:
   isVerificationFile: true
   path: test/many_aplusb.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/many_aplusb.test.cpp

test/factorize.test.cpp.md

@@ -161,7 +161,7 @@ data:
   isVerificationFile: true
   path: test/many_aplusb_128bit.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/many_aplusb_128bit.test.cpp

test/many_aplusb.test.cpp.md

@@ -38,51 +38,54 @@ data:
     \ two for use with the FFT implementation in this file.\n */\ntemplate <typename\
     \ T> void fft_change(std::vector<T> &a) {\n  size_t n = a.size();\n  std::vector<size_t>\
     \ rev(n);\n  for (size_t i = 0; i < n; ++i) {\n    rev[i] = rev[i >> 1] >> 1;\n\
-    \    if (i & 1)\n      rev[i] |= n >> 1;\n    if (i < rev[i])\n      swap(a[i],\
-    \ a[rev[i]]);\n  }\n}\n} // namespace weilycoder\n\n\n#line 8 \"weilycoder/poly/fft.hpp\"\
-    \n\n/**\n * @file fft.hpp\n * @brief Implementation of Fast Fourier Transform\
-    \ (FFT) and its inverse.\n */\n\nnamespace weilycoder {\n/**\n * @brief In-place\
-    \ iterative Cooley\u2013Tukey FFT / inverse FFT on a complex vector.\n *     \
-    \   The length of the input vector should be a power of two.\n * @tparam on Direction\
-    \ of the transform: 1 for FFT, -1 for inverse FFT.\n * @tparam float_t Floating-point\
-    \ type for computations (default: double).\n * @param y Vector of complex numbers\
-    \ to be transformed in-place.\n */\ntemplate <int32_t on = 1, typename float_t\
-    \ = double>\nvoid fft(std::vector<std::complex<float_t>> &y) {\n  static_assert(on\
-    \ == 1 || on == -1, \"on must be 1 or -1\");\n  fft_change(y);\n  for (size_t\
-    \ h = 2; h <= y.size(); h <<= 1) {\n    std::complex<float_t> wn(cos(2 * PI<float_t>\
-    \ / h), sin(on * 2 * PI<float_t> / h));\n    for (size_t j = 0; j < y.size();\
-    \ j += h) {\n      std::complex<float_t> w(1, 0);\n      for (size_t k = j; k\
-    \ < j + (h >> 1); ++k, w *= wn) {\n        std::complex<float_t> u = y[k], t =\
-    \ w * y[k + (h >> 1)];\n        y[k] = u + t, y[k + (h >> 1)] = u - t;\n     \
-    \ }\n    }\n  }\n  size_t len = y.size();\n  if constexpr (on == -1)\n    for\
-    \ (size_t i = 0; i < len; ++i)\n      y[i] /= len;\n}\n} // namespace weilycoder\n\
-    \n\n#line 8 \"weilycoder/poly/fft_convolve.hpp\"\n\n/**\n * @file fft_convolve.hpp\n\
-    \ * @brief Functions for performing convolution using Fast Fourier Transform (FFT).\
-    \  \n */\n\nnamespace weilycoder {\n/**\n * @brief Perform convolution of two\
-    \ complex vectors using FFT.\n * @tparam float_t Floating-point type for computations\
+    \    if (i & 1)\n      rev[i] |= n >> 1;\n    if (i < rev[i])\n      std::swap(a[i],\
+    \ a[rev[i]]);\n  }\n}\n} // namespace weilycoder\n\n\n#line 7 \"weilycoder/poly/fft.hpp\"\
+    \n#include <stdexcept>\n#line 9 \"weilycoder/poly/fft.hpp\"\n\n/**\n * @file fft.hpp\n\
+    \ * @brief Implementation of Fast Fourier Transform (FFT) and its inverse.\n */\n\
+    \nnamespace weilycoder {\n/**\n * @brief In-place iterative Cooley\u2013Tukey\
+    \ FFT / inverse FFT on a complex vector.\n *        The length of the input vector\
+    \ should be a power of two.\n * @tparam on Direction of the transform: 1 for FFT,\
+    \ -1 for inverse FFT.\n * @tparam float_t Floating-point type for computations\
+    \ (default: double).\n * @param y Vector of complex numbers to be transformed\
+    \ in-place.\n */\ntemplate <int32_t on = 1, typename float_t = double>\nvoid fft(std::vector<std::complex<float_t>>\
+    \ &y) {\n  static_assert(on == 1 || on == -1, \"on must be 1 or -1\");\n  fft_change(y);\n\
+    \  size_t len = y.size();\n  if (len == 0 || (len & (len - 1)) != 0)\n    throw\
+    \ std::invalid_argument(\"Length of input vector must be a power of two\");\n\
+    \  for (size_t h = 2; h <= len; h <<= 1) {\n    std::complex<float_t> wn(cos(2\
+    \ * PI<float_t> / h), sin(on * 2 * PI<float_t> / h));\n    for (size_t j = 0;\
+    \ j < len; j += h) {\n      std::complex<float_t> w(1, 0);\n      for (size_t\
+    \ k = j; k < j + (h >> 1); ++k, w *= wn) {\n        std::complex<float_t> u =\
+    \ y[k], t = w * y[k + (h >> 1)];\n        y[k] = u + t, y[k + (h >> 1)] = u -\
+    \ t;\n      }\n    }\n  }\n  if constexpr (on == -1)\n    for (size_t i = 0; i\
+    \ < len; ++i)\n      y[i] /= len;\n}\n} // namespace weilycoder\n\n\n#line 8 \"\
+    weilycoder/poly/fft_convolve.hpp\"\n\n/**\n * @file fft_convolve.hpp\n * @brief\
+    \ Functions for performing convolution using Fast Fourier Transform (FFT).  \n\
+    \ */\n\nnamespace weilycoder {\n/**\n * @brief Perform convolution of two complex\
+    \ vectors using FFT.\n * @tparam float_t Floating-point type for computations\
     \ (default: double).\n * @param a First input vector of complex numbers.\n * @param\
     \ b Second input vector of complex numbers.\n * @return Vector containing the\
     \ convolution result.\n */\ntemplate <typename float_t = double>\nstd::vector<std::complex<float_t>>\
     \ fft_convolve(std::vector<std::complex<float_t>> a,\n                       \
     \                         std::vector<std::complex<float_t>> b) {\n  size_t n\
     \ = 1;\n  while (n < a.size() + b.size() - 1)\n    n <<= 1;\n  a.resize(n), b.resize(n);\n\
-    \  fft(a), fft(b);\n  for (size_t i = 0; i < n; ++i)\n    a[i] *= b[i];\n  return\
-    \ fft<-1>(a), a;\n}\n\n/**\n * @brief Perform convolution of two real-valued vectors\
-    \ using FFT.\n * @tparam float_t Floating-point type for computations (default:\
-    \ double).\n * @param a First input vector of real numbers.\n * @param b Second\
-    \ input vector of real numbers.\n * @return Vector containing the convolution\
-    \ result.\n * @note This function uses a technique that combines two real sequences\
-    \ into\n *       a single complex sequence to perform the convolution more efficiently.\n\
-    \ */\ntemplate <typename float_t = double>\nstd::vector<float_t> fft_convolve_real(const\
-    \ std::vector<float_t> &a,\n                                       const std::vector<float_t>\
-    \ &b) {\n  size_t n = 1;\n  while (n < a.size() + b.size() - 1)\n    n <<= 1;\n\
-    \  std::vector<std::complex<float_t>> F(n);\n  for (size_t i = 0; i < a.size();\
-    \ ++i)\n    F[i].real(a[i]);\n  for (size_t i = 0; i < b.size(); ++i)\n    F[i].imag(b[i]);\n\
-    \  fft(F);\n  for (size_t i = 0; i < n; ++i)\n    F[i] *= F[i];\n  fft<-1>(F);\n\
-    \  std::vector<float_t> result(a.size() + b.size() - 1);\n  for (size_t i = 0;\
-    \ i < result.size(); ++i)\n    result[i] = F[i].imag() / 2;\n  return result;\n\
-    }\n} // namespace weilycoder\n\n\n#line 4 \"test/multiplication_of_big_integers.fft.test.cpp\"\
-    \n#include <algorithm>\n#include <iostream>\n#include <string>\n#line 8 \"test/multiplication_of_big_integers.fft.test.cpp\"\
+    \  fft(a), fft(b);\n  for (size_t i = 0; i < n; ++i)\n    a[i] *= b[i];\n  fft<-1>(a),\
+    \ a.resize(a.size() + b.size() - 1);\n  return a;\n}\n\n/**\n * @brief Perform\
+    \ convolution of two real-valued vectors using FFT.\n * @tparam float_t Floating-point\
+    \ type for computations (default: double).\n * @param a First input vector of\
+    \ real numbers.\n * @param b Second input vector of real numbers.\n * @return\
+    \ Vector containing the convolution result.\n * @note This function uses a technique\
+    \ that combines two real sequences into\n *       a single complex sequence to\
+    \ perform the convolution more efficiently.\n */\ntemplate <typename float_t =\
+    \ double>\nstd::vector<float_t> fft_convolve_real(const std::vector<float_t> &a,\n\
+    \                                       const std::vector<float_t> &b) {\n  size_t\
+    \ n = 1;\n  while (n < a.size() + b.size() - 1)\n    n <<= 1;\n  std::vector<std::complex<float_t>>\
+    \ F(n);\n  for (size_t i = 0; i < a.size(); ++i)\n    F[i].real(a[i]);\n  for\
+    \ (size_t i = 0; i < b.size(); ++i)\n    F[i].imag(b[i]);\n  fft(F);\n  for (size_t\
+    \ i = 0; i < n; ++i)\n    F[i] *= F[i];\n  fft<-1>(F);\n  std::vector<float_t>\
+    \ result(a.size() + b.size() - 1);\n  for (size_t i = 0; i < result.size(); ++i)\n\
+    \    result[i] = F[i].imag() / 2;\n  return result;\n}\n} // namespace weilycoder\n\
+    \n\n#line 4 \"test/multiplication_of_big_integers.fft.test.cpp\"\n#include <algorithm>\n\
+    #include <iostream>\n#include <string>\n#line 8 \"test/multiplication_of_big_integers.fft.test.cpp\"\
     \nusing namespace std;\nusing namespace weilycoder;\n\nstatic void solve() {\n\
     \  string a, b;\n  cin >> a >> b;\n\n  reverse(a.begin(), a.end()), reverse(b.begin(),\
     \ b.end());\n\n  bool negative = false;\n  if (a.back() == '-')\n    negative\
@@ -124,7 +127,7 @@ data:
   isVerificationFile: true
   path: test/multiplication_of_big_integers.fft.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/multiplication_of_big_integers.fft.test.cpp

test/many_aplusb_128bit.test.cpp.md

@@ -103,7 +103,7 @@ data:
   isVerificationFile: true
   path: test/point_add_range_sum.test.cpp
   requiredBy: []
-  timestamp: '2025-11-06 23:46:32+08:00'
+  timestamp: '2025-11-07 09:14:02+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/point_add_range_sum.test.cpp