結果
問題 | No.1973 Divisor Sequence |
ユーザー |
👑 ![]() |
提出日時 | 2023-03-02 09:47:36 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 727 ms / 2,000 ms |
コード長 | 3,202 bytes |
コンパイル時間 | 22,318 ms |
コンパイル使用メモリ | 357,660 KB |
最終ジャッジ日時 | 2025-02-11 01:01:08 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int,int>#define pil pair<int,ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int,int>>#define vpll vector<pair<ll,ll>>#define vvpii vector<vector<pair<int,int>>>#define vvpll vector<vector<pair<ll,ll>>>template<typename T> void debug(T e){cerr << e << endl;}template<typename T> void debug(vector<T> &v){rep(i, v.size()){cerr << v[i] << " ";}cerr << endl;}template<typename T> void debug(vector<vector<T>> &v){rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << " ";}cerr << endl;}}template<typename T> void debug(vector<pair<T, T>> &v){rep(i,v.size()){cerr << v[i].first << " " << v[i].second << endl;}}template<typename T> void debug(set<T> &st){for (auto itr = st.begin(); itr != st.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(multiset<T> &ms){for (auto itr = ms.begin(); itr != ms.end(); itr++){cerr << *itr << " ";}cerr << endl;}template<typename T> void debug(map<T, T> &mp){for (auto itr = mp.begin(); itr != mp.end(); itr++){cerr << itr->first << " " << itr->second << endl;}}void debug_out(){cerr << endl;}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T){cerr << H << " ";debug_out(T...);}int main(){ll N, M;cin >> N >> M;map<ll, ll> mp;ll M_cpy = M;for (ll i = 2; i * i <= M; i++){while(true){if (M_cpy % i != 0){break;}mp[i]++;M_cpy /= i;}}if (M_cpy != 1) mp[M_cpy]++;//debug(mp);ll ans = 1;for (auto itr = mp.begin(); itr != mp.end(); itr++){ll count = itr->second;vvl dp(N, vl(count + 1));for (ll i = 0; i <= count; i++){dp[0][i] = 1;}for (ll i = 1; i < N; i++){for (ll j = 0; j <= count; j++){for (ll k = 0; k + j <= count; k++){dp[i][k] = (dp[i][k] + dp[i - 1][j]) % mod1;}}}ll sum = 0;for (ll i = 0; i <= count; i++){sum = (sum + dp[N - 1][i]) % mod1;}ans = (ans * sum) % mod1;}cout << ans << endl;}