結果
問題 | No.1529 Constant Lcm |
ユーザー | Ogtsn99 |
提出日時 | 2021-06-05 16:59:18 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 9 ms / 3,000 ms |
コード長 | 4,719 bytes |
コンパイル時間 | 2,253 ms |
コンパイル使用メモリ | 204,048 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-05-01 11:00:05 |
合計ジャッジ時間 | 3,199 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 9 ms
6,940 KB |
testcase_11 | AC | 4 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 7 ms
6,940 KB |
testcase_14 | AC | 5 ms
6,944 KB |
testcase_15 | AC | 6 ms
6,944 KB |
testcase_16 | AC | 5 ms
6,944 KB |
testcase_17 | AC | 4 ms
6,944 KB |
testcase_18 | AC | 4 ms
6,940 KB |
testcase_19 | AC | 6 ms
6,944 KB |
testcase_20 | AC | 8 ms
6,948 KB |
testcase_21 | AC | 8 ms
6,940 KB |
testcase_22 | AC | 8 ms
6,944 KB |
testcase_23 | AC | 8 ms
6,944 KB |
testcase_24 | AC | 9 ms
6,944 KB |
testcase_25 | AC | 9 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i, n) for(int (i)=0;(i)<(n);(i)++) #define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--) #define itn int #define miele(v) min_element(v.begin(), v.end()) #define maele(v) max_element(v.begin(), v.end()) #define SUM(v) accumulate(v.begin(), v.end(), 0LL) #define lb(a, key) lower_bound(a.begin(),a.end(),key) #define ub(a, key) upper_bound(a.begin(),a.end(),key) #define COUNT(a, key) count(a.begin(), a.end(), key) #define BITCOUNT(x) __builtin_popcount(x) #define pb push_back #define all(x) (x).begin(),(x).end() #define F first #define S second using P = pair<int, int>; using WeightedGraph = vector<vector<P>>; using UnWeightedGraph = vector<vector<int>>; using Real = long double; using Point = complex<Real>; //Point and Vector2d is the same! // p.real() or real(p) -> x軸, p.imag() or imag(p) -> y軸 using Vector2d = complex<Real>; const int MOD = 998244353; const long long INF = 1LL << 60; const double EPS = 1e-15; const double PI = 3.14159265358979323846; template<typename T> int getIndexOfLowerBound(vector<T> &v, T x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); } template<typename T> int getIndexOfUpperBound(vector<T> &v, T x) { return upper_bound(v.begin(), v.end(), x) - v.begin(); } template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } #define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) istream &operator>>(istream &is, Point &p) { Real a, b; is >> a >> b; p = Point(a, b); return is; } template<typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p_var) { is >> p_var.first >> p_var.second; return is; } template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; } template<typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { os << pair_var.first << ' ' << pair_var.second; return os; } template<typename T> ostream &operator<<(ostream &os, vector<T> &vec) { for (int i = 0; i < vec.size(); i++) os << vec[i] << ' '; return os; } template<typename T, typename U> ostream &operator<<(ostream &os, vector<pair<T, U>> &vec) { for (int i = 0; i < vec.size(); i++) os << vec[i] << '\n'; return os; } template<typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) { for (auto &vec : df) os << vec; return os; } template<typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { repi(itr, map_var) { os << *itr << ' '; itr++; itr--; } return os; } template<typename T> ostream &operator<<(ostream &os, set<T> &set_var) { repi(itr, set_var) { os << *itr << ' '; itr++; itr--; } return os; } void print() { cout << endl; } template<class Head, class... Tail> void print(Head &&head, Tail &&... tail) { cout << head; if (sizeof...(tail) != 0) cout << " "; print(forward<Tail>(tail)...); } vector <bool> primes(1000010,1) ; void Eratosthenes(int n){ for(int i = 2; i <= sqrt(n); i++){ if(primes[i]){ for(int j = 0; i * (j + 2) <= n; j++){ primes[i *(j + 2)] = 0; } } } primes[0] = 0; primes[1] = 0; } int mpow(int x, int n) { int ret = 1; while(n > 0) { if(n & 1) (ret *= x) %= MOD; (x *= x) %= MOD; n >>= 1; } return ret; } signed main(void) { cin.tie(0); ios::sync_with_stdio(false); int n; cin>>n; Eratosthenes(n+1); int ans = 1; for (int i = 2; i <= n-1; ++i) { if(!primes[i]) continue; if(n % i == 0) { int num = n; int t=0; int cnt = 0; while(num % i == 0) { num /= i; cnt++; } t = num; if(t == 1) { ans *= mpow(i, cnt+cnt-2); } else { //print(i, "tが1ではない"); int cnt_t = 0; int _num = 1; while(_num * i <= t-1) { _num *= i; cnt_t++; } //print(cnt, cnt_t); ans *= mpow(i, cnt+cnt+cnt_t); } ans %= MOD; } else { int num = i; while(num * i <= n-1) { num *= i; } ans %= MOD; ans *= (num%MOD); ans %= MOD; } //print(i, ans); } print(ans); }