結果
問題 | No.2326 Factorial to the Power of Factorial to the... |
ユーザー |
|
提出日時 | 2023-05-28 14:18:35 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 2,509 bytes |
コンパイル時間 | 4,068 ms |
コンパイル使用メモリ | 231,392 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-27 00:29:03 |
合計ジャッジ時間 | 5,044 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;// typetypedef long long ll;typedef long double ld;template<class T> using pq = priority_queue<T>;template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;template<class T> using v = vector<T>;#define pl pair<ll, ll>#define vl v<ll>#define vp v<pl>#define vm v<mint>// IN-OUT#define NYAN ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);void Yes(bool b=1) { cout << ( b == 1 ? "Yes" : "No" ) << "\n"; }void YES(bool b=1) { cout << ( b == 1 ? "YES" : "NO" ) << "\n"; }void No(bool b=1) { cout << ( b == 1 ? "No" : "Yes" ) << "\n"; }void NO(bool b=1) { cout << ( b == 1 ? "NO" : "YES" ) << "\n"; }void CIN() {}template <typename T, class... U> void CIN(T &t, U &...u) { cin >> t; CIN(u...); }void COUT() { cout << "\n"; }template <typename T, class... U, char sep = ' '> void COUT(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; COUT(u...); }#define dump(x) cerr << #x << ":"<< x << "\n";#define vdump(x) rep(repeat, sz(x)) cerr << repeat << ":" << x[repeat] << "\n";// macro#define bp __builtin_popcountll#define ALL(x) x.begin(),x.end()#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)#define reps(i, s, n) for (ll i = s; i < (ll)(n); i++)#define sz(x) (ll)x.size()ll xd[]={0, 1, 0, -1, 1, 1, -1, -1};ll yd[]={1, 0, -1, 0, 1, -1, -1, 1};// functiontemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }ll rmax(ll a, ll b){return max(a, b);}ll rmin(ll a, ll b){return min(a, b);}ll rsum(ll a, ll b){return a + b;}ll rzero(){return 0;}// constantlong double PI = 3.14159265358979;#define INF32 2147483647#define INF64 9223372036854775807#define INF 922337203685477580// using mint = modint998244353;using mint = modint1000000007;/* SOLVE BEGIN ************************************************************************** */void solve(){ll n, p;cin >> n >> p;vl num(n + 1);ll P = p;while(p <= n){for(ll i = p; i <= n; i += p) num[i]++;p *= P;}ll sum = accumulate(ALL(num), 0LL);using mint1 = modint;mint1::set_mod(1000000007 - 1);mint1 x = 1;mint y = 1;reps(i, 1, n + 1) x *= i;reps(i, 1, n + 1) y *= i;y = y.pow(x.val());cout << ((mint)sum * y.val()).val() << "\n";}int main(){NYANsolve();return 0;}