結果
問題 | No.2365 Present of good number |
ユーザー |
![]() |
提出日時 | 2023-06-30 21:56:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 46 ms / 2,000 ms |
コード長 | 3,078 bytes |
コンパイル時間 | 1,507 ms |
コンパイル使用メモリ | 126,760 KB |
最終ジャッジ日時 | 2025-02-15 03:49:56 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 39 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <deque>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#include <atcoder/modint>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}using mint = atcoder::modint1000000007;ostream& operator<<(ostream& os, const mint& m){os << m.val();return os;}class Eratosthenes{public:int m;vector<bool> is_prime;vector<int> primes;Eratosthenes(int m_){m = m_;init();}private:void init(){is_prime.assign(m+1, true);is_prime[0] = false, is_prime[1] = false;for(int i = 2; i <= m; i++){if(is_prime[i]){primes.push_back(i);for(int j = 2; i*j <= m; j++) is_prime[i*j] = false;}}}};const int N = 100000;using P = pair<int, int>;Eratosthenes et(N);vector<P> facs[N+1];void init(){vector<int> v(N+1);iota(v.begin(), v.end(), 0);for(int p = 2; p <= N; p++){for(int i = 1; i*p <= N; i++){if(v[i*p]%p != 0) continue;int cnt = 0;while(v[i*p]%p == 0){v[i*p] /= p;cnt++;}facs[i*p].push_back({p, cnt});}}}ll mod_pow(ll a, ll n, ll mod) {ll ans = 1;while (n > 0) {if (n&1) ans = (ans*a)%mod;a = (a*a)% mod;n >>= 1;}return ans;}mint f(int n, ll k){if(k == 0) return mint(n);if(n == 2){ll cycle = k/2;int rem = k%2;int r = mod_pow(2, cycle, mint::mod()-1);if(rem == 0){return mint(2).pow(r);}else{return mint(3).pow(r);}}mint ans = 1;for(auto [p, cnt]: facs[n]){for(auto [q, c]: facs[p+1]){ans *= f(q, k-1).pow(cnt*c);}}return ans;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;init();int n; cin >> n;ll k; cin >> k;cout << f(n, k) << endl;}