結果
問題 | No.2326 Factorial to the Power of Factorial to the... |
ユーザー |
|
提出日時 | 2023-05-28 14:19:20 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 2,595 bytes |
コンパイル時間 | 2,503 ms |
コンパイル使用メモリ | 213,572 KB |
最終ジャッジ日時 | 2025-02-13 11:13:48 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;#define rep(i,n) for (int i=0;i<(int)(n);i++)constexpr uint32_t totient(uint32_t x){uint32_t ans = x;for(uint32_t i = 2; i * i <= x; i++) if(x % i == 0){ans /= i;ans *= i - 1;do x /= i; while(x % i == 0);}if(x != 1){ans /= x;ans *= x - 1;}return ans;}template<uint32_t P> struct Modint{static_assert(P < 0x80000000, "P must be smaller than 2^31");uint32_t a;Modint<totient(P)> b;private:static uint32_t mod(uint64_t x){if(x < P * 2) return uint32_t(x);return uint32_t(x % P) + P;}static uint32_t mul(uint32_t a, uint32_t b){return mod(uint64_t(a) * b);}static uint32_t pow(uint32_t a, uint32_t b){uint32_t ans = 1;while(b){if(b & 1) ans = mul(ans, a);a = mul(a, a);b >>= 1;}return ans;}public:Modint(uint64_t x): a(mod(x)), b(x){}Modint(uint32_t a, Modint<totient(P)> b): a(a), b(b){}uint32_t val() const {if(a < P) return a;return a - P;}Modint& operator*=(const Modint& other){a = mul(a, other.a);b *= other.b;return *this;}Modint operator*(const Modint& other) const {return Modint(*this) *= other;}Modint& operator+=(const Modint& other){a += other.a;if(a >= P * 2) a -= P;if(a >= P * 2) a -= P;b += other.b;return *this;}Modint operator+(const Modint& other) const {return Modint(*this) += other;}Modint pow(const Modint& other) const {return {pow(a, other.b.a), b.pow(other.b)};};};template<> struct Modint<1>{uint32_t a;Modint(uint64_t x): a(bool(x)){}uint32_t val() const {return 0;}Modint& operator*=(const Modint& other){a &= other.a;return *this;}Modint operator*(const Modint& other) const {return Modint(*this) *= other;}Modint& operator+=(const Modint& other){a |= other.a;return *this;}Modint operator+(const Modint& other) const {return Modint(*this) += other;}Modint pow(const Modint& other) const {return {a || !other.a};}};int main(){int n,p;cin>>n>>p;Modint<1000000007> ans=1;for(int i=1;i<=n;i++){ans *= i;}ans = ans.pow(ans);ll ct=0;while(n>=p){ct+=n/p;n/=p;}ans *= ct;cout<<ans.val()<<endl;}