結果

問題 No.1973 Divisor Sequence
ユーザー ___Johniel
提出日時 2022-06-12 01:42:00
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 813 ms / 2,000 ms
コード長 2,699 bytes
コンパイル時間 1,780 ms
コンパイル使用メモリ 174,744 KB
実行使用メモリ 276,996 KB
最終ジャッジ日時 2024-09-22 11:59:47
合計ジャッジ時間 9,033 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// yukicoder/1973/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
// #define endl "\n"
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }
template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; }
template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[]{"; for (auto& i: a) os << i << ","; os << "}"; return os
    ; }
template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }
using lli = long long int;
using ull = unsigned long long;
using point = complex<double>;
using str = string;
template<typename T> using vec = vector<T>;
constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});
constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});
constexpr lli mod = 1e9 + 7;
// constexpr lli mod = 998244353;
int main(int argc, char *argv[])
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios_base::fixed);
  cout.precision(15);
  int n;
  lli x;
  while (cin >> n >> x) {
    map<lli, int> m;
    for (lli i = 2; i * i <= x; ++i) {
      while (x % i == 0) {
        ++m[i];
        x /= i;
      }
    }
    if (x != 1) ++m[x];
    const int N = 5 * 1e5 + 4;
    const int M = 70;
    static lli dp[N][M];
    lli z = 1;
    each (f, m) {
      fill(&dp[0][0], &dp[N - 1][M - 1] + 1, 0);
      dp[0][0] = 1;
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= f.second; ++j) {
          for (int k = 0; j + k <= f.second; ++k) {
            (dp[i + 1][k] += dp[i][j]) %= mod;
          }
        }
      }
      lli y = 0;
      for (int i = 0; i < M; ++i) {
        (y += dp[n][i]) %= mod;
      }
      (z *= y) %= mod;
    }
    cout << z << endl;
  }
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0