#660485 (C++14) No.1050 Zero (Maximum)

• 問題: No.1050 Zero (Maximum)
• ユーザー: hamray
• 提出日時: 2021-05-26 02:22:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 21 ms / 2,000 ms
• コード長: 6,615 bytes
• コンパイル時間: 1,717 ms
• コンパイル使用メモリ: 176,320 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-14 17:23:46
• 合計ジャッジ時間: 2,708 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	6 ms; 5,248 KB
testcase_03	AC	5 ms; 5,248 KB
testcase_04	AC	14 ms; 5,248 KB
testcase_05	AC	14 ms; 5,248 KB
testcase_06	AC	7 ms; 5,248 KB
testcase_07	AC	9 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	5 ms; 5,248 KB
testcase_10	AC	18 ms; 5,248 KB
testcase_11	AC	13 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	19 ms; 5,248 KB
testcase_17	AC	21 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 
using namespace std;
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
 
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
 
#define MOD 1000000007
 
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
const double EPS = 1e-12, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
//ここから編集    
typedef string::const_iterator State;
ll GCD(ll a, ll b){
  return (b==0)?a:GCD(b, a%b);
}
ll LCM(ll a, ll b){
  return a/GCD(a, b) * b;
}
template< int mod >
struct ModInt {
  int x;
 
  ModInt() : x(0) {}
 
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
 
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
 
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
 
  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }
 
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
 
  ModInt operator-() const { return ModInt(-x); }
 
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
 
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
 
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
 
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
 
  bool operator==(const ModInt &p) const { return x == p.x; }
 
  bool operator!=(const ModInt &p) const { return x != p.x; }
 
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
 
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
 
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
 
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }
 
  static int get_mod() { return mod; }
};
 
using modint = ModInt< 1000000007 >;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;
 
  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }
 
  inline T fact(int k) const { return _fact[k]; }
 
  inline T rfact(int k) const { return _rfact[k]; }
 
  inline T inv(int k) const { return _inv[k]; }
 
  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }
 
  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
 
  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
 
template<typename T = long>
struct Matrix{
  int row, col;
  
  std::vector<std::vector<T>> A;
  Matrix() { row = col = 1; }
  Matrix(int h, int w, T val = 0) : row(h), col(w), A(row, std::vector<T>(col, val)){}
  Matrix(const std::vector<std::vector<T>> &v) : row(v.size()), col(v[0].size()), A(v){}
  
  int getRow() const { return row; }
  int getCol() const { return col; }

  Matrix operator+(const Matrix& B) {
    assert(row == B.size()); assert(col == B[0].size());
    Matrix C(row, col);
    for(int i=0; i<row; i++) {
      for(int j=0; j<col; j++) {
        C[i][j] = A[i][j] + B[i][j];
      }
    }
    return C;
  }

  Matrix operator-(const Matrix& B) {
    assert(row == B.size()); assert(col == B[0].size());
    Matrix C(row, col);
    for(int i=0; i<row; i++) {
      for(int j=0; j<col; j++) {
        C[i][j] = A[i][j] - B[i][j];
      }
    }
    return C;
  }

  Matrix operator*(const Matrix& B) {
    assert(col == B.getRow());
    Matrix C(row, B.getCol());
    for(int i=0; i<row; i++) {
      for(int j=0; j<B.size(); j++) {
        for(int k=0; k<B[0].size(); k++) {
          C[i][j] = C[i][j] + A[i][k] * B[k][j];
        }
      }
    }
    return C;
  }

  std::vector<T>& operator[](int i) {
    assert(i >= 0 && i < row);
    return A[i];
  }

  Matrix operator=(const Matrix B) {
    this->A.resize(B.getRow(), std::vector<T>(B.getCol()));
    for(int i=0; i<B.getRow(); i++) { 
      this->A[i] = B[i];
    }
    return *this;
  }

  std::vector<std::vector<T>> mul(const std::vector<std::vector<T>> &A, const std::vector<std::vector<T>> &B, int modulo = 1000000007) {
    std::vector<std::vector<T>> C(A.size(), std::vector<T>(B[0].size()));
    for(int i=0; i<A.size(); i++){
      for(int k=0; k<B.size(); k++){
        for(int j=0; j<B[0].size(); j++){
          C[i][j] = (C[i][j] + A[i][k] * B[k][j] % MOD) % MOD;
        }
      }
    }
    return C;
  }

  Matrix pow(long long n, int modulo = 1000000007) {
    std::vector<std::vector<T>> a(A);
    std::vector<std::vector<T>> b(row, std::vector<T>(col));
    for(int i=0; i<row; i++) b[i][i] = 1;

    while(n > 0){
      if(n&1) b = mul(b, a, modulo);
      a = mul(a, a, modulo);
      n >>= 1;
    }
    return Matrix(b);
  }
  


  friend std::ostream& operator<< (std::ostream& os, const Matrix& m) {
    for(int i=0; i<m.getRow(); i++) {
      for(int j=0; j<m.getCol(); j++) {
        if(j != 0) os << ' ';
        os << m.A[i][j];
      }
      os << '\n';
    }
    return os;
  }
  
};

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);

  int M, K; cin >> M >> K;
  Matrix<long long> m(M, M, 1);
  for(int i=0; i<M; i++) {
    for(int j=0; j<M; j++) {
      m[(i*j)%M][j] = m[(i*j)%M][j] + 1;
    }
  }
  auto m2 = m.pow(K);
  cout << m2[0][0] << endl;
  return 0;
}