conversion to newton basis

Author: adamant-pwn

verify/poly/inv.test.cpp

@@ -1,8 +1,9 @@
 // @brief Inv of Power Series
 #define PROBLEM "https://judge.yosupo.jp/problem/inv_of_formal_power_series"
 #pragma GCC optimize("Ofast,unroll-loops")
-#include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
+#include "blazingio/blazingio.min.hpp"
+#include "cp-algo/math/poly.hpp"
 
 using namespace std;
 using namespace cp_algo::math;
@@ -15,7 +16,7 @@ void solve() {
     int n;
     cin >> n;
     polyn::Vector a(n);
-    copy_n(istream_iterator<base>(cin), n, begin(a));
+    for(auto &it: a) {cin >> it;}
     polyn(a).inv_inplace(n).print(n);
 }
 

verify/poly/newton.test.cpp

@@ -0,0 +1,32 @@
+// @brief Conversion to Newton Basis
+#define PROBLEM "https://judge.yosupo.jp/problem/conversion_from_monomial_basis_to_newton_basis"
+#pragma GCC optimize("Ofast,unroll-loops")
+#include "cp-algo/math/poly.hpp"
+#include <bits/stdc++.h>
+
+using namespace std;
+using namespace cp_algo::math;
+
+const int mod = 998244353;
+using base = modint<mod>;
+using polyn = poly_t<base>;
+
+void solve() {
+    int n;
+    cin >> n;
+    polyn::Vector a(n), p(n);
+    copy_n(istream_iterator<base>(cin), n, begin(a));
+    copy_n(istream_iterator<base>(cin), n, begin(p));
+    polyn(a).to_newton(p).print(n);
+}
+
+signed main() {
+    //freopen("input.txt", "r", stdin);
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int t;
+    t = 1;// cin >> t;
+    while(t--) {
+        solve();
+    }
+}

verify/poly/taylor.test.cpp

@@ -1,7 +1,6 @@
 // @brief Polynomial Taylor Shift
 #define PROBLEM "https://judge.yosupo.jp/problem/polynomial_taylor_shift"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("tune=native")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>