Not_Leonian

Results 8 issues of Not_Leonian

library/polynomial/vec_sparse_fps.hpp の `friend VecSparseFPS operator*(const VecSparseFPS &f, const VecSparseFPS &g)` 関数について、66行目が `h.add_to_last(i, std::move(a));` となっていますが、 `h.add_to_last({ i, std::move(a) });` でないと型が整合しないと考えられます。 また、 `static value_type bostan_mori(VecSparseFPS P, std::vector Q, long long m)` 関数について、119行目の...

Resolves #143 This draft PR implements the `Debug` trait for `LazySegtree`. As mentioned in the issue, the `Debug` implementation uses the `debug_struct` function to display the relevant fields. I would...

Resolves #145 This draft PR implements the `Debug` trait for `FenwickTree`. The previous draft PR with the same content was unintentionally closed, so I’ve created a new branch to both...

Implement the `Clone` and `Debug` traits for `FenwickTree`. For the `Clone` trait, it should be enough to add a `Clone` trait bound to `T` and write an explicit `impl`. For...

Implement the `Clone` trait for `LazySegtree`. Since both `MapMonoid::F` and `::S` have the `Clone` constraint, it can be derived. Additionally, `LazySegtree` already has a `Debug` implementation, but there is a...

Implement the `Clone` and `Debug` traits for `Segtree`. Since `M::S` has the `Clone` constraint, the `Clone` trait can be derived. For the `Debug` trait, I propose adding `use std::fmt::{Debug, Error,...

ドキュメントの「使い方」では `TaylorShift(f, a, C, deg)` と 4 つの引数を取ることになっていますが、実際は `TaylorShift(f, a, C)` の 3 変数で実装されているようです。

## **Describe the bug** Multipoint Evaluation(高速化版)について、与えるxsのサイズが1だとAtCoderのC++23 (gcc 12.2)で正しくない値を返すようです。 ## **Additional context** ABC381-G Multipoint Evaluation(高速化版)に2点以上を与えるように場合分けしたもの (AC): https://atcoder.jp/contests/abc381/submissions/60147219 Multipoint Evaluation(高速化版)に1点以上を与えるもの (WA): https://atcoder.jp/contests/abc381/submissions/60172782 高速化版でないMultipoint Evaluationに0点以上を与えるもの (AC): https://atcoder.jp/contests/abc381/submissions/60173402 AtCoderのC++23 (gcc 12.2)で正しくない値を返す例(なぜか手元のC++ 23だと正しい値を返します) ``` 1...