poly/count_terms.hpp

• View this file on GitHub
• Last update: 2022-05-02 13:06:30+09:00
• Include: #include "poly/count_terms.hpp"
• Link: View error logs on GitHub Actions

Required by

• graph/chromatic.hpp
• graph/count/count_labeled_biconnected.hpp
• graph/count/count_labeled_bipartite.hpp
• graph/count/count_labeled_bridgeless.hpp
• graph/count/count_labeled_connected.hpp
• graph/count/count_labeled_dag.hpp
• graph/count/count_labeled_eulerian.hpp
• graph/count/count_labeled_forest.hpp
• graph/count/count_labeled_strong_digraph.hpp
• graph/count/count_labeled_strong_tournament.hpp
• graph/count/count_labeled_unicyclic.hpp
• linalg/blackbox/vandermonde.hpp
• poly/coef_of_rational_fps.hpp
• poly/coef_of_rational_fps_2d.hpp
• poly/composed_product.hpp
• poly/composed_sum.hpp
• poly/composition_f_1_minus_ex.hpp
• poly/composition_f_a_plus_bx_div_c_plus_dx.hpp
• poly/composition_f_ex.hpp
• poly/composition_f_ex_minus_1.hpp
• poly/composition_f_log_1_minus_x.hpp
• poly/compositional_inverse.hpp
• poly/finding_root_of_polynomial.hpp
• poly/fps_div.hpp
• poly/fps_exp.hpp
• poly/fps_inv.hpp
• poly/fps_inv_2d.hpp
• poly/fps_log.hpp
• poly/fps_pow.hpp
• poly/fps_sqrt.hpp
• poly/multipoint.hpp
• poly/multipoint_evaluation_for_prefix_product.hpp
• poly/multivar_convolution_cyclic.hpp
• poly/partial_frac_decomposition_1.hpp
• poly/poly_divmod.hpp
• poly/poly_gcd.hpp
• poly/poly_mod_pow.hpp
• poly/prefix_sum_of_polynomial.hpp
• poly/product_of_f_rk_x.hpp
• poly/product_of_one_minus_xn.hpp
• poly/product_of_one_plus_xn.hpp
• poly/product_of_pow_of_linear.hpp
• poly/slice_rational_fps.hpp
• poly/sum_of_exp_bx.hpp
• poly/sum_of_power_of_roots.hpp
• seq/famous/bell_number.hpp
• seq/famous/bell_number_large.hpp
• seq/famous/bernoulli.hpp
• seq/famous/indecomposable_permutations.hpp
• seq/famous/partition_number.hpp
• seq/famous/riemann_zeta_even.hpp
• seq/famous/stirling_number_1.hpp
• seq/famous/stirling_number_2.hpp
• seq/famous/surjection.hpp
• seq/interpolate_linear_rec.hpp
• seq/sum_of_powers.hpp

Verified with

• test/1_mytest/bell.test.cpp
• test/1_mytest/bell_number.test.cpp
• test/1_mytest/chirp_z.test.cpp
• test/1_mytest/coef_of_rational.test.cpp
• test/1_mytest/composition_1_minus_ex.test.cpp
• test/1_mytest/composition_ex_minus_1.test.cpp
• test/1_mytest/composition_log_1_minus_x.test.cpp
• test/1_mytest/compositional_inverset.test.cpp
• test/1_mytest/count_bipartite.test.cpp
• test/1_mytest/count_labeled_biconnected.test.cpp
• test/1_mytest/count_labeled_bridgeless.test.cpp
• test/1_mytest/count_labeled_connected.test.cpp
• test/1_mytest/count_labeled_dag.test.cpp
• test/1_mytest/count_labeled_eulerian.test.cpp
• test/1_mytest/count_labeled_forest.test.cpp
• test/1_mytest/count_labeled_strong.test.cpp
• test/1_mytest/count_labeled_tournament.test.cpp
• test/1_mytest/enum_partitions.test.cpp
• test/1_mytest/faulhaber.test.cpp
• test/1_mytest/graph_count.test.cpp
• test/1_mytest/multipoint_prefix.test.cpp
• test/1_mytest/online_division.test.cpp
• test/1_mytest/online_exp.test.cpp
• test/1_mytest/online_inv.test.cpp
• test/1_mytest/online_log.test.cpp
• test/1_mytest/online_pow.test.cpp
• test/1_mytest/online_square.test.cpp
• test/1_mytest/partial_frac.test.cpp
• test/1_mytest/poly_root_finding.test.cpp
• test/1_mytest/power_projection.test.cpp
• test/1_mytest/product_of_one_pm_xn.test.cpp
• test/1_mytest/simple_perm.test.cpp
• test/1_mytest/sparse_pow_2d.test.cpp
• test/1_mytest/stirling_1_suffix.test.cpp
• test/1_mytest/tree_walk_gf.test.cpp
• test/1_mytest/vandermonde.test.cpp
• test/2_library_checker/convolution/multivariate_convolution_cyclic.test.cpp
• test/2_library_checker/enumerative_combinatorics/partition.test.cpp
• test/2_library_checker/enumerative_combinatorics/sharp_p_subset_sum.test.cpp
• test/2_library_checker/enumerative_combinatorics/stirling_number_of_the_first_kind.test.cpp
• test/2_library_checker/enumerative_combinatorics/stirling_number_of_the_first_kind_fixed_k.test.cpp
• test/2_library_checker/enumerative_combinatorics/stirling_number_of_the_second_kind.test.cpp
• test/2_library_checker/graph/chromatic_number.test.cpp
• test/2_library_checker/graph/chromatic_polynomial.test.cpp
• test/2_library_checker/number_theory/bernoulli.test.cpp
• test/2_library_checker/other/kth_term_of_linearly_recurrent_sequence.test.cpp
• test/2_library_checker/polynomial/compositional_inverse.test.cpp
• test/2_library_checker/polynomial/compositional_inverse_dmint.test.cpp
• test/2_library_checker/polynomial/exp_of_fps.test.cpp
• test/2_library_checker/polynomial/exp_of_fps_dmint.test.cpp
• test/2_library_checker/polynomial/exp_of_fps_sparse.test.cpp
• test/2_library_checker/polynomial/exp_of_fps_sparse_dmint.test.cpp
• test/2_library_checker/polynomial/inv_of_fps.test.cpp
• test/2_library_checker/polynomial/inv_of_fps_dmint.test.cpp
• test/2_library_checker/polynomial/inv_of_fps_sparse.test.cpp
• test/2_library_checker/polynomial/inv_of_fps_sparse_dmint.test.cpp
• test/2_library_checker/polynomial/inv_of_polynomials.test.cpp
• test/2_library_checker/polynomial/log_of_fps.test.cpp
• test/2_library_checker/polynomial/log_of_fps_dmint.test.cpp
• test/2_library_checker/polynomial/log_of_fps_sparse.test.cpp
• test/2_library_checker/polynomial/log_of_fps_sparse_dmint.test.cpp
• test/2_library_checker/polynomial/multipoint_evaluation.test.cpp
• test/2_library_checker/polynomial/multipoint_evaluation_on_geom.test.cpp
• test/2_library_checker/polynomial/multipoint_evaluation_on_geom_2.test.cpp
• test/2_library_checker/polynomial/polynomial_division.test.cpp
• test/2_library_checker/polynomial/polynomial_interpolation.test.cpp
• test/2_library_checker/polynomial/polynomial_interpolation_on_geom.test.cpp
• test/2_library_checker/polynomial/pow_of_fps.test.cpp
• test/2_library_checker/polynomial/pow_of_fps_dmint.test.cpp
• test/2_library_checker/polynomial/pow_of_fps_sparse.test.cpp
• test/2_library_checker/polynomial/pow_of_fps_sparse_dmint.test.cpp
• test/2_library_checker/polynomial/slice_rational.test.cpp
• test/2_library_checker/polynomial/sqrt_of_fps.test.cpp
• test/2_library_checker/polynomial/sqrt_of_fps_sparse.test.cpp
• test/3_yukicoder/1080.test.cpp
• test/3_yukicoder/1145.test.cpp
• test/3_yukicoder/1321.test.cpp
• test/3_yukicoder/1357.test.cpp
• test/3_yukicoder/1392.test.cpp
• test/3_yukicoder/1500.test.cpp
• test/3_yukicoder/1516.test.cpp
• test/3_yukicoder/1533.test.cpp
• test/3_yukicoder/1547.test.cpp
• test/3_yukicoder/1549.test.cpp
• test/3_yukicoder/1561.test.cpp
• test/3_yukicoder/1575.test.cpp
• test/3_yukicoder/1755.test.cpp
• test/3_yukicoder/1844.test.cpp
• test/3_yukicoder/1875.test.cpp
• test/3_yukicoder/1939.test.cpp
• test/3_yukicoder/1962.test.cpp
• test/3_yukicoder/2062.test.cpp
• test/3_yukicoder/2097.test.cpp
• test/3_yukicoder/2122.test.cpp
• test/3_yukicoder/2166.test.cpp
• test/3_yukicoder/2243.test.cpp
• test/3_yukicoder/2305.test.cpp
• test/3_yukicoder/2459.test.cpp
• test/3_yukicoder/2580.test.cpp
• test/3_yukicoder/2583.test.cpp
• test/3_yukicoder/2587.test.cpp
• test/3_yukicoder/2587_2.test.cpp
• test/3_yukicoder/2747.test.cpp
• test/3_yukicoder/2877.test.cpp
• test/3_yukicoder/2944.test.cpp
• test/3_yukicoder/541.test.cpp
• test/3_yukicoder/578.test.cpp
• test/3_yukicoder/579.test.cpp
• test/5_atcoder/abc222h.test.cpp
• test/5_atcoder/abc241h.test.cpp
• test/5_atcoder/abc260h.test.cpp
• test/5_atcoder/abc267g.test.cpp
• test/5_atcoder/abc267h.test.cpp
• test/5_atcoder/abc272_h.test.cpp
• test/5_atcoder/abc281g.test.cpp
• test/5_atcoder/abc285h.test.cpp
• test/5_atcoder/abc288ex.test.cpp
• test/5_atcoder/abc318h.test.cpp
• test/5_atcoder/abc331g.test.cpp
• test/5_atcoder/agc013e.test.cpp
• test/5_atcoder/agc058d.test.cpp
• test/5_atcoder/agc058d2.test.cpp
• test/5_atcoder/arc133f.test.cpp
• test/5_atcoder/arc153f.test.cpp
• test/5_atcoder/arc154f.test.cpp
• test/5_atcoder/arc160d.test.cpp
• test/5_atcoder/arc162f.test.cpp

Code

#pragma once
template<typename mint>
int count_terms(const vc<mint>& f){
  int t = 0;
  FOR(i, len(f)) if(f[i] != mint(0)) ++t;
  return t;
}

#line 2 "poly/count_terms.hpp"
template<typename mint>
int count_terms(const vc<mint>& f){
  int t = 0;
  FOR(i, len(f)) if(f[i] != mint(0)) ++t;
  return t;
}

Back to top page