mod/mint.cpp

• View this file on GitHub
• Last update: 2021-03-25 09:46:10+09:00

Required by

• convolution/garner.cpp
• convolution/numbertheoretictransform.cpp
• formalpowerseries/998244353.cpp
• graph/lowlink.cpp
• includes/formalpowerseries.h
• linearalgebra/tree_theorem.cpp
• matching/tutte.cpp
• mod/factorial.cpp
• polynomial/hash.cpp

Verified with

• test/aoj/0314.test.cpp
• test/aoj/1300.test.cpp
• test/aoj/1630.test.cpp
• test/aoj/2222.test.cpp
• test/aoj/2397.test.cpp
• test/aoj/2405.test.cpp
• test/aoj/2560.test.cpp
• test/aoj/2951.test.cpp
• test/aoj/2959.test.cpp
• test/aoj/2971.test.cpp
• test/aoj/2977.test.cpp
• test/aoj/2983.test.cpp
• test/aoj/2985.garner.test.cpp
• test/aoj/2985.test.cpp
• test/aoj/3072.test.cpp
• test/aoj/3074.test.cpp
• test/aoj/3084.test.cpp
• test/aoj/3179.test.cpp
• test/aoj/DPL_5_A.test.cpp
• test/aoj/DPL_5_B.test.cpp
• test/aoj/DPL_5_C.test.cpp
• test/aoj/DPL_5_D.test.cpp
• test/aoj/DPL_5_E.test.cpp
• test/aoj/DPL_5_F.test.cpp
• test/aoj/DPL_5_G.test.cpp
• test/aoj/DPL_5_H.test.cpp
• test/aoj/DPL_5_I.test.cpp
• test/aoj/DPL_5_J.test.cpp
• test/aoj/DPL_5_K.test.cpp
• test/aoj/DPL_5_L.test.cpp
• test/yosupo/bernoulli_number.test.cpp
• test/yosupo/bitwise_and_convolution.test.cpp
• test/yosupo/bitwise_xor_convolution.test.cpp
• test/yosupo/convolution_mod.test.cpp
• test/yosupo/convolution_mod_1000000007.garner.test.cpp
• test/yosupo/convolution_mod_1000000007.test.cpp
• test/yosupo/dynamic_sequence_range_affine_range_sum.test.cpp
• test/yosupo/dynamic_tree_vertex_set_path_composite.test.cpp
• test/yosupo/dynamic_tree_vertex_set_path_composite.toptree.test.cpp
• test/yosupo/exp_of_formal_power_series.test.cpp
• test/yosupo/find_linear_recurrence.test.cpp
• test/yosupo/inv_of_formal_power_series.test.cpp
• test/yosupo/kth_term_of_linearly_recurrent_sequence.test.cpp
• test/yosupo/log_of_formal_power_series.test.cpp
• test/yosupo/matrix_det.test.cpp
• test/yosupo/multipoint_evaluation.test.cpp
• test/yosupo/partition_function.test.cpp
• test/yosupo/point_set_range_composite.test.cpp
• test/yosupo/polynomial_interpolation.test.cpp
• test/yosupo/polynomial_taylor_shift.test.cpp
• test/yosupo/pow_of_formal_power_series.test.cpp
• test/yosupo/queue_operate_all_composite.test.cpp
• test/yosupo/range_affine_range_sum.test.cpp
• test/yosupo/sharp_p_subset_sum.test.cpp
• test/yosupo/sqrt_of_formal_power_series.test.cpp
• test/yosupo/stirling_number_of_the_first_kind.test.cpp
• test/yosupo/stirling_number_of_the_second_kind.test.cpp
• test/yosupo/subset_convolution.test.cpp
• test/yukicoder/0022.test.cpp
• test/yukicoder/0104.test.cpp
• test/yukicoder/0444.test.cpp
• test/yukicoder/1504.test.cpp
• test/yukicoder/1665.test.cpp
• test/yukicoder/1973.test.cpp
• test/yukicoder/2520.test.cpp
• test/yukicoder/2744.test.cpp
• test/yukicoder/2772.test.cpp
• test/yukicoder/3211.test.cpp
• test GCDConvolution (test/yukicoder/3267.test.cpp)
• test/yukicoder/4271.test.cpp
• test/yukicoder/5011.test.cpp
• test/yukicoder/5025.test.cpp
• test/yukicoder/5633.test.cpp
• test LCMConvolution (test/yukicoder/7107.test.cpp)

Code

#ifndef call_from_test
#include <bits/stdc++.h>
using namespace std;
#endif

//BEGIN CUT HERE
template<typename T, T MOD = 1000000007>
struct Mint{
  inline static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator+() const{return *this;}
  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif

#line 1 "mod/mint.cpp"

#include <bits/stdc++.h>
using namespace std;
#endif

//BEGIN CUT HERE
template<typename T, T MOD = 1000000007>
struct Mint{
  inline static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator+() const{return *this;}
  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif

Back to top page