cp-algorithms
diff --git a/‎verify/simd/many_facts.test.cpp renamed to ‎verify/combi/many_facts.test.cpp b/‎verify/simd/many_facts.test.cpp renamed to ‎verify/combi/many_facts.test.cpp
diff --git a/‎verify/combi/many_facts_dynamic.test.cpp
Lines changed: 34 additions & 0 deletions b/‎verify/combi/many_facts_dynamic.test.cpp
Lines changed: 34 additions & 0 deletions
@@ -0,0 +1,34 @@
+// @brief Many Factorials (dynamic Mod)
+#define PROBLEM "https://judge.yosupo.jp/problem/many_factorials"
+#pragma GCC optimize("Ofast,unroll-loops")
+#define CP_ALGO_CHECKPOINT
+#include <bits/stdc++.h>
+#include "blazingio/blazingio.min.hpp"
+#include "cp-algo/math/factorials.hpp"
+
+using namespace std;
+using base = cp_algo::math::dynamic_modint<>;
+
+void solve() {
+    int n;
+    cin >> n;
+    base::switch_mod(998'244'353);
+    vector<base> args(n);
+    for(auto &x : args) {cin >> x;}
+    cp_algo::checkpoint("read");
+    auto res = facts<true, 100'000>(args);
+    for(auto it: res) {cout << it << "\n";}
+    cp_algo::checkpoint("write");
+    cp_algo::checkpoint<1>();
+}
+
+signed main() {
+    //freopen("input.txt", "r", stdin);
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int t = 1;
+    //cin >> t;
+    while(t--) {
+        solve();
+    }
+}