#ifndef INCLUDE_MODE #define INCLUDE_MODE // #define REACTIVE // #define USE_GETLINE #endif #ifdef INCLUDE_MAIN IN VO Solve() { CIN( int , N ); vector A( N + 1 ); FOREQ( i , 1 , N ){ cin >> A[i]; } CEXPR( int , L , 1e5 ); vector count_next( L + 1 ); count_next[0] = 1; CumulativeSum count( count_next ); FOREQ( i , 1 , N ){ int j_max = L - A[i]; FOREQ( j , 0 , j_max ){ int B_max = min( j , j + A[i] - A[i-1] ); count_next[j] = count.IntervalSum( 0 , B_max ); } FOREQ( j , j_max + 1 , L ){ count_next[j] = 0; } count.Set( count_next ); } RETURN( count.IntervalSum( 0 , L ) ); } REPEAT_MAIN(1); #else // INCLUDE_MAIN #ifdef INCLUDE_SUB // COMPAREに使用。圧縮時は削除する。 ll Naive( int N , int M , int K ) { ll answer = N + M + K; return answer; } // COMPAREに使用。圧縮時は削除する。 ll Answer( ll N , ll M , ll K ) { // START_WATCH; ll answer = N + M + K; // // TLに準じる乱択や全探索。デフォルトの猶予は100.0[ms]。 // CEXPR( double , TL , 2000.0 ); // while( CHECK_WATCH( TL ) ){ // } return answer; } // 圧縮時は中身だけ削除する。 IN VO Experiment() { // CEXPR( int , bound , 10 ); // FOREQ( N , 0 , bound ){ // FOREQ( M , 0 , bound ){ // FOREQ( K , 0 , bound ){ // COUT( N , M , K , ":" , Naive( N , M , K ) ); // } // } // // cout << Naive( N ) << ",\n"[N==bound]; // } } // 圧縮時は中身だけ削除する。 IN VO SmallTest() { // CEXPR( int , bound , 10 ); // FOREQ( N , 0 , bound ){ // FOREQ( M , 0 , bound ){ // FOREQ( K , 0 , bound ){ // COMPARE( N , M , K ); // } // } // // COMPARE( N ); // } } #define INCLUDE_MAIN #include __FILE__ #else // INCLUDE_SUB #ifdef INCLUDE_LIBRARY /* C-x 3 C-x o C-x C-fによるファイル操作用 BFS: c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/BreadthFirstSearch/compress.txt CoordinateCompress: c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/CoordinateCompress/compress.txt DFSOnTree c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/DepthFirstSearch/Tree/a.hpp Divisor: c:/Users/user/Documents/Programming/Mathematics/Arithmetic/Prime/Divisor/compress.txt IntervalAddBIT c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/AffineSpace/BIT/IntervalAdd/compress.txt Polynomial c:/Users/user/Documents/Programming/Mathematics/Polynomial/compress.txt UnionFind c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/UnionFindForest/compress.txt */ // VVV 常設でないライブラリは以下に挿入する。 // 木上で群に値を持つ関数の累積積を計算する。 template class VirtualCumulativeProd { public: // 0 <= i,j < m_sizeの場合のみサポート。 // iからへのpathがi=v_0->...->v_k=jの時、Setした配列aに対する // 右総乗a[v_0]...a[v_k]を計算する。 virtual U PathProd( const int& i , const int& j ) = 0; protected: virtual int Parent( const int& i ) = 0; virtual int LCA( const int& i , const int& j ) = 0; }; template class PathProdImplementation : virtual public VirtualCumulativeProd { protected: int m_size; GROUP m_M; vector m_right; vector m_left; public: inline PathProdImplementation( const int& size , GROUP M ); inline U PathProd( const int& i , const int& j ); }; // 木が特に通常の配列である場合。 // 入力の範囲内で要件 // (1) MがUの群構造である。 // が成り立つ場合にのみサポート。 // M.one()による初期化O(size) // 配列による初期化O(size) // 一点左乗算O(size) // 一点右乗算O(size) // 右区間積取得O(1) // 左区間積取得O(1) // 右区間積逆像数え上げO(size log size) // 右区間積逆像数え上げO(size log size) // 以下は入力の範囲内で要件 // (2) operator<(const U&,const U&)に関してMがUの全順序可換群構造である。 // (3) 各成分がM.One()より小さくない。 // を満たす場合にのみサポート。 // 左端点を固定した時に左区間積がu以上となる要素の添字の最小値の二分探索O(log_2 size) // 左端点を固定した時に右区間積がu以上となる要素の添字の最小値の二分探索O(log_2 size) template class AbstractCumulativeProd : public PathProdImplementation { public: inline AbstractCumulativeProd( GROUP M , const vector& a = vector() ); inline void Set( const vector& a ); // a[i]をM.Product(a[i],u)に置き変える。 inline void RightMultiply( const int& i , const U& u ); // a[i]をM.Product(u,a[i])に置き変える。 inline void LeftMultiply( const int& i , const U& u ); // 0 <= iかつi-1 <= j < m_sizeの場合のみサポート。 // 右区間積a[i]...a[j]をMに関して計算する。 inline U RightIntervalProd( const int& i , const int& j ); // 左区間積a[j]...a[i]をMに関して計算する。 inline U LeftIntervalProd( const int& i , const int& j ); // 以下はM.Product()しか使用しないので、M.Product()が群演算でさえあればM.One()とM.Inverse()が無関係な演算でもよい。 // Mに関する右区間積a[i]...a[j]がuと等しい区間[i,j]の個数を計算する。 ll CountRightIntervalProdInverseImage( const U& u = One() ); // Mに関する左区間積a[j]...a[i]がuと等しい区間[i,j]の個数を計算する。 ll CountLeftIntervalProdInverseImage( const U& u = One() ); // RightIntervalProd( i_start , i )がu以上となるi_start以上のiが存在する場合にその最小値を2進法で探索。 // 存在しない場合はN以上の最小の2羃×2-1を返す（N以上であることで判定可能）。 int RightBinarySearch( const int& i_start , const U& u ); // LeftIntervalProd( i_start , i )がu以上となるi_start以上のiが存在する場合にその最小値を2進法で探索。 // 存在しない場合はN以上の最小の2羃×2-1を返す（N以上であることで判定可能）。 int LeftBinarySearch( const int& i_start , const U& u ); private: inline int Parent( const int& i ); inline int LCA( const int& i , const int& j ); inline const U& One() const; }; template AbstractCumulativeProd( GROUP M ) -> AbstractCumulativeProd,GROUP>; template class CumulativeSum : public AbstractCumulativeProd> { public: inline CumulativeSum( const int& size = 0 ); inline CumulativeSum( const vector& a ); // a[i]をM.Sum(u,a[i])に置き変える。 inline void Add( const int& i , const U& u ); // 0 <= iかつi-1 <= j < m_sizeの場合のみサポート。 // 区間和a[i]+...+a[j]を計算する。 inline U IntervalSum( const int& i , const int& j ); // 区間和a[i]+...+a[j]がuと等しい区間[i,j]の個数を計算する。 ll CountIntervalSumInverseImage( const U& u = U() ); // IntervalSum( i_start , i )がu以上となるi_start以上のiが存在する場合にその最小値を2進法で探索。 // 存在しない場合はN以上の最小の2羃×2-1を返す（N以上であることで判定可能）。 int BinarySearch( const int& i_start , const U& u ); }; template inline PathProdImplementation::PathProdImplementation( const int& size , GROUP M ) : m_size( size ) , m_M( move( M ) ) , m_right( m_size , m_M.One() ) , m_left( m_right ) {} template inline AbstractCumulativeProd::AbstractCumulativeProd( GROUP M , const vector& a ) : PathProdImplementation( a.size() , move( M ) ) { if( !a.empty() ){ this->m_right[0] = this->m_left[0] = a[0]; for( int i = 1 ; i < this->m_size ; i++ ){ this->m_right[i] = this->m_M.Product( this->m_right[i-1] , a[i] ); this->m_left[i] = this->m_M.Product( a[i] , this->m_left[i-1] ); } } } template inline CumulativeSum::CumulativeSum( const int& size ) : CumulativeSum( vector( size ) ){} template inline CumulativeSum::CumulativeSum( const vector& a ) : AbstractCumulativeProd>( AdditiveGroup() , a ) {} template inline void AbstractCumulativeProd::Set( const vector& a ) { *this = AbstractCumulativeProd( move( this->m_M ) , a ); } template inline void AbstractCumulativeProd::RightMultiply( const int& i , const U& u ) { const U m_right_i_inv = this->m_M.Inverse( this->m_right[i] ); const U& m_right_i = this->m_right[i] = this->m_M.Product( this->m_right[i] , u ); for( int j = i + 1 ; j < this->m_size ; j++ ){ this->m_right[j] = this->m_M.Product( m_right_i , this->m_M.Product( m_right_i_inv , this->m_right[j] ) ); } const U m_left_i_prev_inv = i == this->m_size - 1 ? One() : this->m_M.Inverse( this->m_left[i-1] ); const U m_left_i_prev = this->m_M.Product( u , this->m_left[i-1] ); for( int j = i + 1 ; j < this->m_size ; j++ ){ this->m_left[j] = this->m_M.Product( this->m_M.Product( this->m_left[j] , m_left_i_prev_inv ) , m_left_i_prev ); } } template inline void AbstractCumulativeProd::LeftMultiply( const int& i , const U& u ) { const U m_right_i_prev_inv = i == 0 ? One() : this->m_M.Inverse( this->m_right[i-1] ); const U m_right_i_prev = i == 0 ? u : this->m_M.Product( this->m_right[i-1] , u ); for( int j = i ; j < this->m_size ; j++ ){ this->m_right[j] = this->m_M.Product( m_right_i_prev , this->m_M.Product( m_right_i_prev_inv , this->m_right[j] ) ); } const U m_left_i_inv = this->m_M.Inverse( this->m_left[i] ); const U& m_left_i = this->m_left[i] = this->m_M.Product( u , this->m_left[i] ); for( int j = i + 1 ; j < this->m_size ; j++ ){ this->m_left[j] = this->m_M.Product( this->m_M.Product( this->m_left[j] , m_left_i_inv ) , m_left_i ); } } template inline void CumulativeSum::Add( const int& i , const U& u ) { this->RightMultiply( i , u ); } template inline U PathProdImplementation::PathProd( const int& i , const int& j ) { assert( 0 <= i && i < m_size && 0 <= j && j < m_size ); const int k = this->LCA( i , j ); return m_M.Product( m_M.Product( m_left[i] , m_M.Inverse( m_left[k] ) ) , k == 0 ? m_right[j] : m_M.Product( m_M.Inverse( m_right[this->Parent( k ) ] ) , m_right[j] )); } template inline U AbstractCumulativeProd::RightIntervalProd( const int& i , const int& j ) { assert( i - 1 <= j ); return i <= j ? i == 0 ? this->m_right[j] : this->m_M.Product( this->m_M.Inverse( this->m_right[i-1] ) , this->m_right[j] ) : One(); } template inline U AbstractCumulativeProd::LeftIntervalProd( const int& i , const int& j ) { assert( i - 1 <= j ); return i <= j ? i == 0 ? this->m_left[j] : this->m_M.Product( this->m_left[j] , this->m_M.Inverse( this->m_left[i - 1] ) ) : One(); } template inline U CumulativeSum::IntervalSum( const int& i , const int& j ) { return this->RightIntervalProd( i , j ); } template ll AbstractCumulativeProd::CountRightIntervalProdInverseImage( const U& u ) { Map f{}; f[u]++; ll answer = 0; for( int i = 0 ; i < this->m_size ; i++ ){ const U& m_right_i = this->m_right[i]; f.count( m_right_i ) == 1 ? answer += f[m_right_i] : answer; f[this->m_M.Product( m_right_i , u )]++; } return answer; } template ll AbstractCumulativeProd::CountLeftIntervalProdInverseImage( const U& u ) { Map f{}; f[u]++; ll answer = 0; for( int i = 0 ; i < this->m_size ; i++ ){ const U& m_left_i = this->m_left[i]; f.count( m_left_i ) == 1 ? answer += f[m_left_i] : answer; f[this->m_M.Product( u , m_left_i )]++; } return answer; } template ll CumulativeSum::CountIntervalSumInverseImage( const U& u ) { return this->CountRightIntervalProdInverseImage( u ); } template int AbstractCumulativeProd::RightBinarySearch( const int& i_start , const U& u ) { int l = i_start - 1; int r = this->m_size - 1; while( l + 1 < r ){ int m = ( l + r ) / 2; ( RightIntervalProd( i_start , m ) < u ? l : r ) = m; } return r; } template int AbstractCumulativeProd::LeftBinarySearch( const int& i_start , const U& u ) { int l = i_start - 1; int r = this->m_size - 1; while( l + 1 < r ){ int m = ( l + r ) / 2; ( LeftIntervalProd( i_start , m ) < u ? l : r ) = m; } return r; } template int CumulativeSum::BinarySearch( const int& i_start , const U& u ) { return this->RightBinarySearch( i_start , u ); } template inline int AbstractCumulativeProd::Parent( const int& i ) { return i - 1; } template inline int AbstractCumulativeProd::LCA( const int& i , const int& j ) { return min( i , j ); } template inline const U& AbstractCumulativeProd::One() const { return this->m_M.One(); } // AAA 常設でないライブラリは以上に挿入する。 #define INCLUDE_SUB #include __FILE__ #else // INCLUDE_LIBRARY #ifdef DEBUG #define _GLIBCXX_DEBUG #define REPEAT_MAIN( BOUND ) START_MAIN; signal( SIGABRT , &AlertAbort ); AutoCheck( exec_mode , use_getline ); if( exec_mode == sample_debug_mode || exec_mode == submission_debug_mode || exec_mode == library_search_mode ){ RE 0; } else if( exec_mode == experiment_mode ){ Experiment(); RE 0; } else if( exec_mode == small_test_mode ){ SmallTest(); RE 0; }; DEXPR( int , bound_test_case_num , BOUND , min( BOUND , 100 ) ); int test_case_num = 1; if( exec_mode == solve_mode ){ if CE( bound_test_case_num > 1 ){ SET_ASSERT( test_case_num , 1 , bound_test_case_num ); } } else if( exec_mode == random_test_mode ){ CERR( "ランダムテストを行う回数を指定してください。" ); SET_LL( test_case_num ); } FINISH_MAIN #define DEXPR( LL , BOUND , VALUE , DEBUG_VALUE ) CEXPR( LL , BOUND , DEBUG_VALUE ) #define ASSERT( A , MIN , MAX ) CERR( "ASSERTチェック： " , ( MIN ) , ( ( MIN ) <= A ? "<=" : ">" ) , A , ( A <= ( MAX ) ? "<=" : ">" ) , ( MAX ) ); AS( ( MIN ) <= A && A <= ( MAX ) ) #define SET_ASSERT( A , MIN , MAX ) if( exec_mode == solve_mode ){ SET_LL( A ); ASSERT( A , MIN , MAX ); } else if( exec_mode == random_test_mode ){ CERR( #A , " = " , ( A = GetRand( MIN , MAX ) ) ); } else { AS( false ); } #define SOLVE_ONLY ST_AS( __FUNCTION__[0] == 'S' ) #define CERR( ... ) VariadicCout( cerr , __VA_ARGS__ ) << endl #define COUT( ... ) VariadicCout( cout << "出力： " , __VA_ARGS__ ) << endl #define CERR_A( A , N ) OUTPUT_ARRAY( cerr , A , N ) << endl #define COUT_A( A , N ) cout << "出力： "; OUTPUT_ARRAY( cout , A , N ) << endl #define CERR_ITR( A ) OUTPUT_ITR( cerr , A ) << endl #define COUT_ITR( A ) cout << "出力： "; OUTPUT_ITR( cout , A ) << endl #else #pragma GCC optimize ( "O3" ) #pragma GCC optimize ( "unroll-loops" ) #pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" ) #define REPEAT_MAIN( BOUND ) START_MAIN; CEXPR( int , bound_test_case_num , BOUND ); int test_case_num = 1; if CE( bound_test_case_num > 1 ){ SET_ASSERT( test_case_num , 1 , bound_test_case_num ); } FINISH_MAIN #define DEXPR( LL , BOUND , VALUE , DEBUG_VALUE ) CEXPR( LL , BOUND , VALUE ) #define ASSERT( A , MIN , MAX ) AS( ( MIN ) <= A && A <= ( MAX ) ) #define SET_ASSERT( A , MIN , MAX ) SET_LL( A ); ASSERT( A , MIN , MAX ) #define SOLVE_ONLY #define CERR( ... ) #define COUT( ... ) VariadicCout( cout , __VA_ARGS__ ) << ENDL #define CERR_A( A , N ) #define COUT_A( A , N ) OUTPUT_ARRAY( cout , A , N ) << ENDL #define CERR_ITR( A ) #define COUT_ITR( A ) OUTPUT_ITR( cout , A ) << ENDL #endif #ifdef REACTIVE #define ENDL endl #else #define ENDL "\n" #endif #ifdef USE_GETLINE #define SET_LL( A ) { GETLINE( A ## _str ); A = stoll( A ## _str ); } #define GETLINE_SEPARATE( SEPARATOR , ... ) SOLVE_ONLY; string __VA_ARGS__; VariadicGetline( cin , SEPARATOR , __VA_ARGS__ ) #define GETLINE( ... ) SOLVE_ONLY; GETLINE_SEPARATE( '\n' , __VA_ARGS__ ) #else #define SET_LL( A ) cin >> A #define CIN( LL , ... ) SOLVE_ONLY; LL __VA_ARGS__; VariadicCin( cin , __VA_ARGS__ ) #define SET_A( A , N ) SOLVE_ONLY; FOR( VARIABLE_FOR_CIN_A , 0 , N ){ cin >> A[VARIABLE_FOR_CIN_A]; } #define CIN_A( LL , A , N ) VE A( N ); SET_A( A , N ); #endif #include using namespace std; #define ATT __attribute__( ( target( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" ) ) ) #define START_MAIN int main(){ ios_base::sync_with_stdio( false ); cin.tie( nullptr ) #define FINISH_MAIN REPEAT( test_case_num ){ if CE( bound_test_case_num > 1 ){ CERR( "testcase " , VARIABLE_FOR_REPEAT_test_case_num , ":" ); } Solve(); CERR( "" ); } } #define START_WATCH chrono::system_clock::time_point watch = chrono::system_clock::now() #define CURRENT_TIME static_cast( chrono::duration_cast( chrono::system_clock::now() - watch ).count() / 1000.0 ) #define CHECK_WATCH( TL_MS ) ( CURRENT_TIME < TL_MS - 100.0 ) #define CEXPR( LL , BOUND , VALUE ) CE LL BOUND = VALUE #define CIN_ASSERT( A , MIN , MAX ) decldecay_t( MAX ) A; SET_ASSERT( A , MIN , MAX ) #define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( decldecay_t( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) #define FOREQ( VAR , INITIAL , FINAL ) for( decldecay_t( FINAL ) VAR = INITIAL ; VAR <= FINAL ; VAR ++ ) #define FOREQINV( VAR , INITIAL , FINAL ) for( decldecay_t( INITIAL ) VAR = INITIAL ; VAR + 1 > FINAL ; VAR -- ) #define AUTO_ITR( ARRAY ) auto itr_ ## ARRAY = ARRAY .BE() , end_ ## ARRAY = ARRAY .EN() #define FOR_ITR( ARRAY ) for( AUTO_ITR( ARRAY ) , itr = itr_ ## ARRAY ; itr_ ## ARRAY != end_ ## ARRAY ; itr_ ## ARRAY ++ , itr++ ) #define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT_ ## HOW_MANY_TIMES , 0 , HOW_MANY_TIMES ) #define SET_PRECISION( DECIMAL_DIGITS ) cout << fixed << setprecision( DECIMAL_DIGITS ) #define OUTPUT_ARRAY( OS , A , N ) FOR( VARIABLE_FOR_OUTPUT_ARRAY , 0 , N ){ OS << A[VARIABLE_FOR_OUTPUT_ARRAY] << (VARIABLE_FOR_OUTPUT_ARRAY==N-1?"":" "); } OS #define OUTPUT_ITR( OS , A ) { auto ITERATOR_FOR_OUTPUT_ITR = A.BE() , EN_FOR_OUTPUT_ITR = A.EN(); bool VARIABLE_FOR_OUTPUT_ITR = ITERATOR_FOR_COUT_ITR != END_FOR_COUT_ITR; WH( VARIABLE_FOR_OUTPUT_ITR ){ OS << *ITERATOR_FOR_COUT_ITR; ( VARIABLE_FOR_OUTPUT_ITR = ++ITERATOR_FOR_COUT_ITR != END_FOR_COUT_ITR ) ? OS : OS << " "; } } OS #define RETURN( ... ) SOLVE_ONLY; COUT( __VA_ARGS__ ); RE #define COMPARE( ... ) auto naive = Naive( __VA_ARGS__ ); auto answer = Answer( __VA_ARGS__ ); bool match = naive == answer; COUT( "(" , #__VA_ARGS__ , ") == (" , __VA_ARGS__ , ") : Naive == " , naive , match ? "==" : "!=" , answer , "== Answer" ); if( !match ){ RE; } // 圧縮用 #define TE template #define TY typename #define US using #define ST static #define AS assert #define IN inline #define CL class #define PU public #define OP operator #define CE constexpr #define CO const #define NE noexcept #define RE return #define WH while #define VO void #define VE vector #define LI list #define BE begin #define EN end #define SZ size #define LE length #define PW Power #define MO move #define TH this #define CRI CO int& #define CRUI CO uint& #define CRL CO ll& #define VI virtual #define ST_AS static_assert #define reMO_CO remove_const #define is_COructible_v is_constructible_v #define rBE rbegin #define reSZ resize // 型のエイリアス #define decldecay_t( VAR ) decay_t TE US ret_t = decltype( declval()( declval()... ) ); TE US inner_t = TY T::type; US uint = unsigned int; US ll = long long; US ull = unsigned long long; US ld = long double; US lld = __float128; TE US T2 = pair; TE US T3 = tuple; TE US T4 = tuple; US path = pair; // 入出力用 TE IN basic_istream& VariadicCin( basic_istream& is ) { RE is; } TE IN basic_istream& VariadicCin( basic_istream& is , Arg& arg , ARGS&... args ) { RE VariadicCin( is >> arg , args... ); } TE IN basic_istream& VariadicGetline( basic_istream& is , CO char& separator ) { RE is; } TE IN basic_istream& VariadicGetline( basic_istream& is , CO char& separator , Arg& arg , ARGS&... args ) { RE VariadicGetline( getline( is , arg , separator ) , separator , args... ); } TE IN basic_ostream& operator<<( basic_ostream& os , CO VE& arg ) { auto BE = arg.BE() , EN = arg.EN(); auto itr = BE; WH( itr != EN ){ ( itr == BE ? os : os << " " ) << *itr; itr++; } RE os; } TE IN basic_ostream& VariadicCout( basic_ostream& os , CO Arg& arg ) { RE os << arg; } TE IN basic_ostream& VariadicCout( basic_ostream& os , CO Arg1& arg1 , CO Arg2& arg2 , CO ARGS&... args ) { RE VariadicCout( os << arg1 << " " , arg2 , args... ); } // 算術用 TE CE T PositiveBaseResidue( CO T& a , CO T& p ){ RE a >= 0 ? a % p : p - 1 - ( ( - ( a + 1 ) ) % p ); } TE CE T Residue( CO T& a , CO T& p ){ RE PositiveBaseResidue( a , p < 0 ? -p : p ); } TE CE T PositiveBaseQuotient( CO T& a , CO T& p ){ RE ( a - PositiveBaseResidue( a , p ) ) / p; } TE CE T Quotient( CO T& a , CO T& p ){ RE p < 0 ? PositiveBaseQuotient( -a , -p ) : PositiveBaseQuotient( a , p ); } #define POWER( ANSWER , ARGUMENT , EXPONENT ) \ ST_AS( ! is_same::value && ! is_same::value ); \ decldecay_t( ARGUMENT ) ANSWER{ 1 }; \ { \ decldecay_t( ARGUMENT ) ARGUMENT_FOR_SQUARE_FOR_POWER = ( ARGUMENT ); \ decldecay_t( EXPONENT ) EXPONENT_FOR_SQUARE_FOR_POWER = ( EXPONENT ); \ WH( EXPONENT_FOR_SQUARE_FOR_POWER != 0 ){ \ if( EXPONENT_FOR_SQUARE_FOR_POWER % 2 == 1 ){ \ ANSWER *= ARGUMENT_FOR_SQUARE_FOR_POWER; \ } \ ARGUMENT_FOR_SQUARE_FOR_POWER *= ARGUMENT_FOR_SQUARE_FOR_POWER; \ EXPONENT_FOR_SQUARE_FOR_POWER /= 2; \ } \ } \ #define POWER_MOD( ANSWER , ARGUMENT , EXPONENT , MODULO ) \ ll ANSWER{ 1 }; \ { \ ll ARGUMENT_FOR_SQUARE_FOR_POWER = ( ( ARGUMENT ) % ( MODULO ) ) % ( MODULO ); \ ARGUMENT_FOR_SQUARE_FOR_POWER < 0 ? ARGUMENT_FOR_SQUARE_FOR_POWER += ( MODULO ) : ARGUMENT_FOR_SQUARE_FOR_POWER; \ decldecay_t( EXPONENT ) EXPONENT_FOR_SQUARE_FOR_POWER = ( EXPONENT ); \ WH( EXPONENT_FOR_SQUARE_FOR_POWER != 0 ){ \ if( EXPONENT_FOR_SQUARE_FOR_POWER % 2 == 1 ){ \ ANSWER = ( ANSWER * ARGUMENT_FOR_SQUARE_FOR_POWER ) % ( MODULO ); \ } \ ARGUMENT_FOR_SQUARE_FOR_POWER = ( ARGUMENT_FOR_SQUARE_FOR_POWER * ARGUMENT_FOR_SQUARE_FOR_POWER ) % ( MODULO ); \ EXPONENT_FOR_SQUARE_FOR_POWER /= 2; \ } \ } \ #define FACTORIAL_MOD( ANSWER , ANSWER_INV , INVERSE , MAX_INDEX , CE_LENGTH , MODULO ) \ ll ANSWER[CE_LENGTH]; \ ll ANSWER_INV[CE_LENGTH]; \ ll INVERSE[CE_LENGTH]; \ { \ ll VARIABLE_FOR_PRODUCT_FOR_FACTORIAL = 1; \ ANSWER[0] = VARIABLE_FOR_PRODUCT_FOR_FACTORIAL; \ FOREQ( i , 1 , MAX_INDEX ){ \ ANSWER[i] = ( VARIABLE_FOR_PRODUCT_FOR_FACTORIAL *= i ) %= ( MODULO ); \ } \ ANSWER_INV[0] = ANSWER_INV[1] = INVERSE[1] = VARIABLE_FOR_PRODUCT_FOR_FACTORIAL = 1; \ FOREQ( i , 2 , MAX_INDEX ){ \ ANSWER_INV[i] = ( VARIABLE_FOR_PRODUCT_FOR_FACTORIAL *= INVERSE[i] = ( MODULO ) - ( ( ( ( MODULO ) / i ) * INVERSE[ ( MODULO ) % i ] ) % ( MODULO ) ) ) %= ( MODULO ); \ } \ } \ // 二分探索用 // EXPRESSIONがANSWERの広義単調関数の時、EXPRESSION >= CO_TARGETの整数解を格納。 #define BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , DESIRED_INEQUALITY , CO_TARGET , INEQUALITY_FOR_CHECK , UPDATE_U , UPDATE_L , UPDATE_ANSWER ) \ ST_AS( ! is_same::value && ! is_same::value ); \ ll ANSWER = MINIMUM; \ { \ ll L_BS = MINIMUM; \ ll U_BS = MAXIMUM; \ ANSWER = UPDATE_ANSWER; \ ll EXPRESSION_BS; \ CO ll CO_TARGET_BS = ( CO_TARGET ); \ ll DIFFERENCE_BS; \ WH( L_BS < U_BS ){ \ DIFFERENCE_BS = ( EXPRESSION_BS = ( EXPRESSION ) ) - CO_TARGET_BS; \ CERR( "二分探索中：" , "L_BS =" , L_BS , "<=" , #ANSWER , "=" , ANSWER , "<=" , U_BS , "= U_BS :" , #EXPRESSION , "-" , #CO_TARGET , "=" , EXPRESSION_BS , "-" , CO_TARGET_BS , "=" , DIFFERENCE_BS ); \ if( DIFFERENCE_BS INEQUALITY_FOR_CHECK 0 ){ \ U_BS = UPDATE_U; \ } else { \ L_BS = UPDATE_L; \ } \ ANSWER = UPDATE_ANSWER; \ } \ if( L_BS > U_BS ){ \ CERR( "二分探索失敗：" , "L_BS =" , L_BS , ">" , U_BS , "= U_BS :" , #ANSWER , ":=" , #MAXIMUM , "+ 1 =" , MAXIMUM + 1 ); \ CERR( "二分探索マクロにミスがある可能性があります。変更前の版に戻してください。" ); \ ANSWER = MAXIMUM + 1; \ } else { \ CERR( "二分探索終了：" , "L_BS =" , L_BS , "<=" , #ANSWER , "=" , ANSWER , "<=" , U_BS , "= U_BS" ); \ CERR( "二分探索が成功したかを確認するために" , #EXPRESSION , "を計算します。" ); \ CERR( "成功判定が不要な場合はこの計算を削除しても構いません。" ); \ EXPRESSION_BS = ( EXPRESSION ); \ CERR( "二分探索結果：" , #EXPRESSION , "=" , EXPRESSION_BS , ( EXPRESSION_BS > CO_TARGET_BS ? ">" : EXPRESSION_BS < CO_TARGET_BS ? "<" : "=" ) , CO_TARGET_BS ); \ if( EXPRESSION_BS DESIRED_INEQUALITY CO_TARGET_BS ){ \ CERR( "二分探索成功：" , #ANSWER , ":=" , ANSWER ); \ } else { \ CERR( "二分探索失敗：" , #ANSWER , ":=" , #MAXIMUM , "+ 1 =" , MAXIMUM + 1 ); \ CERR( "単調でないか、単調増加性と単調減少性を逆にしてしまったか、探索範囲内に解が存在しません。" ); \ ANSWER = MAXIMUM + 1; \ } \ } \ } \ // 単調増加の時にEXPRESSION >= CO_TARGETの最小解を格納。 #define BS1( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , >= , CO_TARGET , >= , ANSWER , ANSWER + 1 , ( L_BS + U_BS ) / 2 ) \ // 単調増加の時にEXPRESSION <= CO_TARGETの最大解を格納。 #define BS2( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , <= , CO_TARGET , > , ANSWER - 1 , ANSWER , ( L_BS + 1 + U_BS ) / 2 ) \ // 単調減少の時にEXPRESSION >= CO_TARGETの最大解を格納。 #define BS3( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , >= , CO_TARGET , < , ANSWER - 1 , ANSWER , ( L_BS + 1 + U_BS ) / 2 ) \ // 単調減少の時にEXPRESSION <= CO_TARGETの最小解を格納。 #define BS4( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , <= , CO_TARGET , <= , ANSWER , ANSWER + 1 , ( L_BS + U_BS ) / 2 ) \ // t以下の値が存在すればその最大値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MaximumLeq( set& S , CO T& t ) { CO auto EN = S.EN(); if( S.empty() ){ RE EN; } auto itr = S.upper_bound( t ); RE itr == EN ? S.find( *( S.rBE() ) ) : itr == S.BE() ? EN : --itr; } // t未満の値が存在すればその最大値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MaximumLt( set& S , CO T& t ) { CO auto EN = S.EN(); if( S.empty() ){ RE EN; } auto itr = S.lower_bound( t ); RE itr == EN ? S.find( *( S.rBE() ) ) : itr == S.BE() ? EN : --itr; } // t以上の値が存在すればその最小値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MinimumGeq( set& S , CO T& t ) { RE S.lower_bound( t ); } // tより大きい値が存在すればその最小値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MinimumGt( set& S , CO T& t ) { RE S.upper_bound( t ); } // データ構造用 TE TY V> IN V OP+( CO V& a0 , CO V& a1 ) { if( a0.empty() ){ RE a1; } if( a1.empty() ){ RE a0; } AS( a0.SZ() == a1.SZ() ); V answer{}; for( auto itr0 = a0.BE() , itr1 = a1.BE() , EN0 = a0.EN(); itr0 != EN0 ; itr0++ , itr1++ ){ answer.push_back( *itr0 + *itr1 ); } RE answer; } TE IN pair OP+( CO pair& t0 , CO pair& t1 ) { RE { t0.first + t1.first , t0.second + t1.second }; } TE IN tuple OP+( CO tuple& t0 , CO tuple& t1 ) { RE { get<0>( t0 ) + get<0>( t1 ) , get<1>( t0 ) + get<1>( t1 ) , get<2>( t0 ) + get<2>( t1 ) }; } TE IN tuple OP+( CO tuple& t0 , CO tuple& t1 ) { RE { get<0>( t0 ) + get<0>( t1 ) , get<1>( t0 ) + get<1>( t1 ) , get<2>( t0 ) + get<2>( t1 ) , get<3>( t0 ) + get<3>( t1 ) }; } TE IN T Add( CO T& t0 , CO T& t1 ) { RE t0 + t1; } TE IN T XorAdd( CO T& t0 , CO T& t1 ){ RE t0 ^ t1; } TE IN T Multiply( CO T& t0 , CO T& t1 ) { RE t0 * t1; } TE IN CO T& Zero() { ST CO T z{}; RE z; } TE IN CO T& One() { ST CO T o = 1; RE o; }\ TE IN T AddInv( CO T& t ) { RE -t; } TE IN T Id( CO T& v ) { RE v; } TE IN T Min( CO T& a , CO T& b ){ RE a < b ? a : b; } TE IN T Max( CO T& a , CO T& b ){ RE a < b ? b : a; } TE TY V> IN auto Get( CO V& a ) { return [&]( CRI i = 0 ){ RE a[i]; }; } // グリッド問題用 int H , W , H_minus , W_minus , HW; VE> non_wall; IN T2 EnumHW( CRI v ) { RE { v / W , v % W }; } IN int EnumHW_inv( CRI h , CRI w ) { RE h * W + w; } CO string direction[4] = {"U","R","D","L"}; // (i,j)->(k,h)の方向番号を取得 IN int DirectionNumberOnGrid( CRI i , CRI j , CRI k , CRI h ){RE ik?0:jh?3:(AS(false),-1);} // v->wの方向番号を取得 IN int DirectionNumberOnGrid( CRI v , CRI w ){auto [i,j]=EnumHW(v);auto [k,h]=EnumHW(w);RE DirectionNumberOnGrid(i,j,k,h);} // 方向番号の反転U<->D、R<->L IN int ReverseDirectionNumberOnGrid( CRI n ){AS(0<=n&&n<4);RE(n+2)%4;} IN VO SetEdgeOnGrid( CO string& Si , CRI i , LI ( &e )[] , CO char& walkable = '.' ){FOR(j,0,W){if(Si[j]==walkable){int v = EnumHW_inv(i,j);if(i>0){e[EnumHW_inv(i-1,j)].push_back(v);}if(i+10){e[EnumHW_inv(i,j-1)].push_back(v);}if(j+1 ( &e )[] , CO char& walkable = '.' ){FOR(j,0,W){if(Si[j]==walkable){CO int v=EnumHW_inv(i,j);if(i>0){e[EnumHW_inv(i-1,j)].push_back({v,1});}if(i+10){e[EnumHW_inv(i,j-1)].push_back({v,1});}if(j+1>& non_wall , CO char& walkable = '.' , CO char& unwalkable = '#' ){non_wall.push_back(VE(W));auto& non_wall_i=non_wall[i];FOR(j,0,W){non_wall_i[j]=Si[j]==walkable?true:(assert(Si[j]==unwalkable),false);}} // デバッグ用 #ifdef DEBUG IN VO AlertAbort( int n ) { CERR( "abort関数が呼ばれました。assertマクロのメッセージが出力されていない場合はオーバーフローの有無を確認をしてください。" ); } VO AutoCheck( int& exec_mode , CO bool& use_getline ); IN VO Solve(); IN VO Experiment(); IN VO SmallTest(); IN VO RandomTest(); ll GetRand( CRL Rand_min , CRL Rand_max ); IN VO BreakPoint( CRI LINE ) {} int exec_mode; CEXPR( int , solve_mode , 0 ); CEXPR( int , sample_debug_mode , 1 ); CEXPR( int , submission_debug_mode , 2 ); CEXPR( int , library_search_mode , 3 ); CEXPR( int , experiment_mode , 4 ); CEXPR( int , small_test_mode , 5 ); CEXPR( int , random_test_mode , 6 ); #ifdef USE_GETLINE CEXPR( bool , use_getline , true ); #else CEXPR( bool , use_getline , false ); #endif #else ll GetRand( CRL Rand_min , CRL Rand_max ) { ll answer = time( NULL ); RE answer * rand() % ( Rand_max + 1 - Rand_min ) + Rand_min; } #endif // VVV 常設ライブラリは以下に挿入する。 // Map // c:/Users/user/Documents/Programming/Mathematics/Function/Map/compress.txt CL is_ordered{PU:is_ordered()= delete;TE ST CE auto Check(CO T& t)-> decltype(t < t,true_type());ST CE false_type Check(...);TE ST CE CO bool value = is_same_v< decltype(Check(declval())),true_type >;}; TE US Map = conditional_t>,unordered_map,conditional_t,map,VO>>; // Algebra // c:/Users/user/Documents/Programming/Mathematics/Algebra/compress.txt #define DC_OF_CPOINT(POINT)IN CO U& POINT()CO NE #define DC_OF_POINT(POINT)IN U& POINT() NE #define DF_OF_CPOINT(POINT)TE IN CO U& VirtualPointedSet::POINT()CO NE{RE Point();} #define DF_OF_POINT(POINT)TE IN U& VirtualPointedSet::POINT()NE{RE Point();} TE CL UnderlyingSet{PU:US type = U;};TE CL VirtualPointedSet:VI PU UnderlyingSet{PU:VI CO U& Point()CO NE = 0;VI U& Point() NE = 0;DC_OF_CPOINT(Unit);DC_OF_CPOINT(Zero);DC_OF_CPOINT(One);DC_OF_CPOINT(Infty);DC_OF_POINT(init);DC_OF_POINT(root);};TE CL PointedSet:VI PU VirtualPointedSet{PU:U m_b_U;IN PointedSet(CO U& b_u = U());IN CO U& Point()CO NE;IN U& Point() NE;};TE CL VirtualNSet:VI PU UnderlyingSet{PU:VI U Transfer(CO U& u)= 0;IN U Inverse(CO U& u);};TE CL AbstractNSet:VI PU VirtualNSet{PU:F_U& m_f_U;IN AbstractNSet(F_U& f_U);IN U Transfer(CO U& u);};TE CL VirtualMagma:VI PU UnderlyingSet{PU:VI U Product(CO U& u0,CO U& u1)= 0;IN U Sum(CO U& u0,CO U& u1);};TE CL AdditiveMagma:VI PU VirtualMagma{PU:IN U Product(CO U& u0,CO U& u1);};TE CL MultiplicativeMagma:VI PU VirtualMagma{PU:IN U Product(CO U& u0,CO U& u1);};TE CL AbstractMagma:VI PU VirtualMagma{PU:M_U& m_m_U;IN AbstractMagma(M_U& m_U);IN U Product(CO U& u0,CO U& u1);}; TE IN PointedSet::PointedSet(CO U& b_U):m_b_U(b_U){}TE IN CO U& PointedSet::Point()CO NE{RE m_b_U;}TE IN U& PointedSet::Point()NE{RE m_b_U;}DF_OF_CPOINT(Unit);DF_OF_CPOINT(Zero);DF_OF_CPOINT(One);DF_OF_CPOINT(Infty);DF_OF_POINT(init);DF_OF_POINT(root);TE IN AbstractNSet::AbstractNSet(F_U& f_U):m_f_U(f_U){ST_AS(is_invocable_r_v);}TE IN U AbstractNSet::Transfer(CO U& u){RE m_f_U(u);}TE IN U VirtualNSet::Inverse(CO U& u){RE Transfer(u);}TE IN AbstractMagma::AbstractMagma(M_U& m_U):m_m_U(m_U){ST_AS(is_invocable_r_v);}TE IN U AdditiveMagma::Product(CO U& u0,CO U& u1){RE u0 + u1;}TE IN U MultiplicativeMagma::Product(CO U& u0,CO U& u1){RE u0 * u1;}TE IN U AbstractMagma::Product(CO U& u0,CO U& u1){RE m_m_U(u0,u1);}TE IN U VirtualMagma::Sum(CO U& u0,CO U& u1){RE Product(u0,u1);} TE CL VirtualMonoid:VI PU VirtualMagma,VI PU VirtualPointedSet{};TE CL AdditiveMonoid:VI PU VirtualMonoid,PU AdditiveMagma,PU PointedSet{};TE CL MultiplicativeMonoid:VI PU VirtualMonoid,PU MultiplicativeMagma,PU PointedSet{PU:IN MultiplicativeMonoid(CO U& e_U);};TE CL AbstractMonoid:VI PU VirtualMonoid,PU AbstractMagma,PU PointedSet{PU:IN AbstractMonoid(M_U& m_U,CO U& e_U);}; TE IN MultiplicativeMonoid::MultiplicativeMonoid(CO U& e_U):PointedSet(e_U){}TE IN AbstractMonoid::AbstractMonoid(M_U& m_U,CO U& e_U):AbstractMagma(m_U),PointedSet(e_U){} TE CL VirtualGroup:VI PU VirtualMonoid,VI PU VirtualPointedSet,VI PU VirtualNSet{};TE CL AdditiveGroup:VI PU VirtualGroup,PU AdditiveMonoid{PU:IN U Transfer(CO U& u);};TE CL AbstractGroup:VI PU VirtualGroup,PU AbstractMonoid,PU AbstractNSet{PU:IN AbstractGroup(M_U& m_U,CO U& e_U,I_U& i_U);IN U Transfer(CO U& u);}; TE IN AbstractGroup::AbstractGroup(M_U& m_U,CO U& e_U,I_U& i_U):AbstractMonoid(m_U,e_U),AbstractNSet(i_U){}TE IN U AbstractGroup::Transfer(CO U& u){RE this->mf_U(u);}TE IN U AdditiveGroup::Transfer(CO U& u){RE -u;} // Graph // c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/compress.txt TE CL VirtualGraph:VI PU UnderlyingSet{PU:VI R1 Enumeration(CRI i)= 0;VI R2 Enumeration_inv(CO T& t)= 0;IN VO Reset();VI CRI SZ()CO NE = 0;VI E& edge()NE = 0;VI ret_t Edge(CO T& t)= 0;};TE CL EdgeImplimentation:VI PU VirtualGraph{PU:int m_SZ;E m_edge;IN EdgeImplimentation(CRI SZ,E edge);IN CRI SZ()CO NE;IN E& edge()NE;IN ret_t Edge(CO T& t);};TE CL Graph:PU EdgeImplimentation{PU:IN Graph(CRI SZ,E edge);IN CRI Enumeration(CRI i);IN CRI Enumeration_inv(CRI t);TE IN Graph GetGraph(F edge)CO;};TE CL EnumerationGraph:PU EdgeImplimentation,ret_t,E>{PU:Enum_T& m_enum_T;Enum_T_inv& m_enum_T_inv;IN EnumerationGraph(CRI SZ,Enum_T& enum_T,Enum_T_inv& enum_T_inv,E edge);IN ret_t Enumeration(CRI i);IN ret_t Enumeration_inv(CO T& t);TE IN EnumerationGraph GetGraph(F edge)CO;};TE EnumerationGraph(CRI SZ,Enum_T enum_T,Enum_T_inv enum_T_inv,E edge)-> EnumerationGraph()(0)),Enum_T,Enum_T_inv,E>;TE CL MemorisationGraph:PU EdgeImplimentation{PU:int m_LE;VE m_memory;Map m_memory_inv;IN MemorisationGraph(CRI SZ,E edge);IN T Enumeration(CRI i);IN CRI Enumeration_inv(CO T& t);IN VO Reset();TE IN MemorisationGraph GetGraph(F edge)CO;};TE MemorisationGraph(CRI SZ,E edge)-> MemorisationGraph()().back()),E>;TE MemorisationGraph(CRI SZ,E edge)-> MemorisationGraph(declval()().back())),E>; TE IN EdgeImplimentation::EdgeImplimentation(CRI SZ,E edge):m_SZ(SZ),m_edge(MO(edge)){ST_AS(is_COructible_v && is_COructible_v && is_invocable_v);}TE IN Graph::Graph(CRI SZ,E edge):EdgeImplimentation(SZ,MO(edge)){}TE IN EnumerationGraph::EnumerationGraph(CRI SZ,Enum_T& enum_T,Enum_T_inv& enum_T_inv,E edge):EdgeImplimentation,ret_t,E>(SZ,MO(edge)),m_enum_T(enum_T),m_enum_T_inv(enum_T_inv){}TE IN MemorisationGraph::MemorisationGraph(CRI SZ,E edge):EdgeImplimentation(SZ,MO(edge)),m_LE(),m_memory(),m_memory_inv(){ST_AS(is_invocable_v && is_invocable_v);}TE IN CRI Graph::Enumeration(CRI i){RE i;}TE IN ret_t EnumerationGraph::Enumeration(CRI i){RE m_enum_T(i);}TE IN T MemorisationGraph::Enumeration(CRI i){AS(0 <= i && i < m_LE);RE m_memory[i];}TE IN CRI Graph::Enumeration_inv(CRI i){RE i;}TE IN ret_t EnumerationGraph::Enumeration_inv(CO T& t){RE m_enum_T_inv(t);}TE IN CRI MemorisationGraph::Enumeration_inv(CO T& t){if(m_memory_inv.count(t)== 0){AS(m_LE < TH->SZ());m_memory.push_back(t);RE m_memory_inv[t]= m_LE++;}RE m_memory_inv[t];}TE VO VirtualGraph::Reset(){}TE IN VO MemorisationGraph::Reset(){m_LE = 0;m_memory.clear();m_memory_inv.clear();}TE IN CRI EdgeImplimentation::SZ()CO NE{RE m_SZ;}TE IN E& EdgeImplimentation::edge()NE{RE m_edge;}TE IN ret_t EdgeImplimentation::Edge(CO T& t){RE m_edge(t);}TE TE IN Graph Graph::GetGraph(F edge)CO{RE Graph(TH->SZ(),MO(edge));}TE TE IN EnumerationGraph EnumerationGraph::GetGraph(F edge)CO{RE EnumerationGraph(TH->SZ(),m_enum_T,m_enum_T_inv,MO(edge));}TE TE IN MemorisationGraph MemorisationGraph::GetGraph(F edge)CO{RE MemorisationGraph(TH->SZ(),MO(edge));} // ConstexprModulo // c:/Users/user/Documents/Programming/Mathematics/Arithmetic/Mod/ConstexprModulo/compress.txt CEXPR(uint,P,998244353);TE CE INT& RS(INT& n)NE{RE n < 0?((((++n)*= -1)%= M)*= -1)+= M - 1:n %= M;}TE CE uint& RS(uint& n)NE{RE n %= M;}TE CE ull& RS(ull& n)NE{RE n %= M;}TE CE INT& RSP(INT& n)NE{CE CO uint trunc =(1 << 23)- 1;INT n_u = n >> 23;n &= trunc;INT n_uq =(n_u / 7)/ 17;n_u -= n_uq * 119;n += n_u << 23;RE n < n_uq?n += P - n_uq:n -= n_uq;}TE <> CE ull& RS(ull& n)NE{CE CO ull Pull = P;CE CO ull Pull2 =(Pull - 1)*(Pull - 1);RE RSP(n > Pull2?n -= Pull2:n);}TE CE INT RS(INT&& n)NE{RE MO(RS(n));}TE CE INT RS(CO INT& n)NE{RE RS(INT(n));} #define SFINAE_FOR_MOD(DEFAULT)TY T,enable_if_t>>* DEFAULT #define DC_OF_CM_FOR_MOD(FUNC)CE bool OP FUNC(CO Mod& n)CO NE #define DC_OF_AR_FOR_MOD(FUNC)CE Mod OP FUNC(CO Mod& n)CO NE;TE CE Mod OP FUNC(T&& n)CO NE; #define DF_OF_CM_FOR_MOD(FUNC)TE CE bool Mod::OP FUNC(CO Mod& n)CO NE{RE m_n FUNC n.m_n;} #define DF_OF_AR_FOR_MOD(FUNC,FORMULA)TE CE Mod Mod::OP FUNC(CO Mod& n)CO NE{RE MO(Mod(*TH)FUNC ## = n);}TE TE CE Mod Mod::OP FUNC(T&& n)CO NE{RE FORMULA;}TE CE Mod OP FUNC(T&& n0,CO Mod& n1)NE{RE MO(Mod(forward(n0))FUNC ## = n1);} TE CL Mod{PU:uint m_n;CE Mod()NE;CE Mod(CO Mod& n)NE;CE Mod(Mod& n)NE;CE Mod(Mod&& n)NE;TE CE Mod(CO T& n)NE;TE CE Mod(T& n)NE;TE CE Mod(T&& n)NE;CE Mod& OP=(CO Mod& n)NE;CE Mod& OP=(Mod&& n)NE;CE Mod& OP+=(CO Mod& n)NE;CE Mod& OP-=(CO Mod& n)NE;CE Mod& OP*=(CO Mod& n)NE;IN Mod& OP/=(CO Mod& n);CE Mod& OP<<=(int n)NE;CE Mod& OP>>=(int n)NE;CE Mod& OP++()NE;CE Mod OP++(int)NE;CE Mod& OP--()NE;CE Mod