結果
問題 | No.1529 Constant Lcm |
ユーザー | milanis48663220 |
提出日時 | 2021-06-04 21:33:07 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,320 ms / 3,000 ms |
コード長 | 3,801 bytes |
コンパイル時間 | 1,330 ms |
コンパイル使用メモリ | 127,316 KB |
実行使用メモリ | 71,680 KB |
最終ジャッジ日時 | 2024-04-30 01:49:00 |
合計ジャッジ時間 | 24,441 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 563 ms
67,712 KB |
testcase_01 | AC | 554 ms
67,584 KB |
testcase_02 | AC | 546 ms
67,584 KB |
testcase_03 | AC | 557 ms
67,584 KB |
testcase_04 | AC | 546 ms
67,584 KB |
testcase_05 | AC | 552 ms
67,584 KB |
testcase_06 | AC | 547 ms
67,584 KB |
testcase_07 | AC | 556 ms
67,584 KB |
testcase_08 | AC | 545 ms
67,712 KB |
testcase_09 | AC | 552 ms
67,584 KB |
testcase_10 | AC | 1,003 ms
71,296 KB |
testcase_11 | AC | 731 ms
68,992 KB |
testcase_12 | AC | 556 ms
67,712 KB |
testcase_13 | AC | 946 ms
70,784 KB |
testcase_14 | AC | 775 ms
69,632 KB |
testcase_15 | AC | 810 ms
69,632 KB |
testcase_16 | AC | 749 ms
69,248 KB |
testcase_17 | AC | 658 ms
68,608 KB |
testcase_18 | AC | 657 ms
68,608 KB |
testcase_19 | AC | 791 ms
69,760 KB |
testcase_20 | AC | 1,069 ms
71,552 KB |
testcase_21 | AC | 1,093 ms
71,552 KB |
testcase_22 | AC | 1,070 ms
71,680 KB |
testcase_23 | AC | 1,095 ms
71,552 KB |
testcase_24 | AC | 1,320 ms
71,552 KB |
testcase_25 | AC | 1,217 ms
71,552 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #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; const ll MOD = 998244353; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v < 0) _v = (v%MOD)+MOD; if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } void operator+=(ll n){ v = (v+n)%MOD; } void operator-=(ll n){ v = (v-n+MOD)%MOD; } void operator*=(ll n){ v = (v*n+MOD)%MOD; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } void operator+=(ModInt n){ v = (v+n.v)%MOD; } void operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; } void operator*=(ModInt n){ v = (v*n.v)%MOD; } void operator=(ModInt n){ v = n.v; } bool operator==(ModInt n){ return v == n.v; } bool operator!=(ModInt n){ return v != n.v; } void operator=(ll n){ v = n%MOD; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt pow(ModInt a, ll n) { assert(n >= 0); ModInt ans = 1; ModInt tmp = a; for (int i = 0; i <= 60; i++) { ll m = (ll)1 << i; if (m & n) { ans *= tmp; } tmp *= tmp; } return ans; } using mint = ModInt; const int N_MAX = 1000000; bool is_prime[N_MAX+1]; int a[N_MAX+1]; int cnt[N_MAX+1]; vector<int> facs[N_MAX+1]; void init(){ for(int i = 2; i <= N_MAX; i++){ is_prime[i] = true; a[i] = i; } for(int i = 2; i <= N_MAX; i++){ if(is_prime[i]){ for(int j = 1; i*j <= N_MAX; j++){ if(j != 1) is_prime[i*j] = false; while(a[i*j]%i == 0) { facs[i*j].push_back(i); a[i*j] /= i; } } } } } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; init(); int n; cin >> n; for(int i = 1; i <= n-1; i++){ map<int, int> mp; for(int x : facs[i]) { if(mp.count(x)) mp[x]++; else mp[x] = 1; } for(int x : facs[n-i]) { if(mp.count(x)) mp[x]++; else mp[x] = 1; } for(auto [x, c]: mp) { chmax(cnt[x], c); } } mint ans = 1; for(int i = 2; i <= N_MAX; i++){ if(!is_prime[i]) continue; if(cnt[i] == 0) continue; ans *= pow(mint(i), cnt[i]); } cout << ans << endl; }