結果
問題 | No.2891 Mint |
ユーザー | dyktr_06 |
提出日時 | 2024-09-13 21:55:09 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 175 ms / 2,000 ms |
コード長 | 9,483 bytes |
コンパイル時間 | 4,524 ms |
コンパイル使用メモリ | 266,784 KB |
実行使用メモリ | 52,584 KB |
最終ジャッジ日時 | 2024-09-13 21:55:32 |
合計ジャッジ時間 | 10,262 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 140 ms
52,452 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 175 ms
52,584 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 139 ms
52,580 KB |
testcase_18 | AC | 78 ms
27,876 KB |
testcase_19 | AC | 71 ms
28,008 KB |
testcase_20 | AC | 131 ms
52,580 KB |
testcase_21 | AC | 72 ms
27,876 KB |
testcase_22 | AC | 150 ms
52,452 KB |
testcase_23 | AC | 59 ms
27,876 KB |
testcase_24 | AC | 127 ms
52,580 KB |
testcase_25 | AC | 161 ms
52,576 KB |
testcase_26 | AC | 156 ms
52,580 KB |
testcase_27 | AC | 149 ms
52,576 KB |
testcase_28 | AC | 166 ms
52,452 KB |
testcase_29 | AC | 74 ms
28,004 KB |
testcase_30 | AC | 132 ms
52,576 KB |
testcase_31 | AC | 77 ms
28,004 KB |
testcase_32 | AC | 140 ms
52,452 KB |
testcase_33 | AC | 111 ms
52,448 KB |
testcase_34 | AC | 119 ms
52,580 KB |
testcase_35 | AC | 129 ms
52,580 KB |
testcase_36 | AC | 140 ms
52,456 KB |
testcase_37 | AC | 116 ms
52,576 KB |
testcase_38 | AC | 108 ms
52,456 KB |
testcase_39 | AC | 127 ms
52,580 KB |
testcase_40 | AC | 130 ms
52,456 KB |
testcase_41 | AC | 70 ms
27,876 KB |
testcase_42 | AC | 2 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 125 ms
52,452 KB |
testcase_48 | AC | 125 ms
52,552 KB |
testcase_49 | AC | 138 ms
52,580 KB |
testcase_50 | AC | 47 ms
27,876 KB |
testcase_51 | AC | 111 ms
52,580 KB |
testcase_52 | AC | 36 ms
15,472 KB |
testcase_53 | AC | 97 ms
52,452 KB |
testcase_54 | AC | 105 ms
52,580 KB |
testcase_55 | AC | 24 ms
15,716 KB |
testcase_56 | AC | 138 ms
52,580 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); 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; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } template <typename T> T arithmeticsum(T a, T d, T n){ return n * (a * 2 + (n - 1) * d) / 2; } template <typename T> vector<tuple<T, T, T>> enumerate_quotients(const T &n){ vector<tuple<T, T, T>> res; for(T l = 1; l <= n;){ const T quotient = n / l; const T r = n / quotient + 1; // [l, r) res.emplace_back(l, r, quotient); l = r; } return res; } namespace modcalc{ template <typename T> T modpow(T x, T n, const T &m){ T ret = 1 % m; x %= m; while(n > 0){ if(n & 1) (ret *= x) %= m; (x *= x) %= m; n >>= 1; } return ret; } template <typename T> T modinv(T a, T m){ T b = m, u = 1, v = 0; while(b){ T t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if(u < 0) u += m; return u; } template <typename T> T modarithmeticsum(T a, T d, T n, T m){ T m2 = m * 2; a %= m2, n %= m2, d %= m2; T b = (n + m2 - 1) * d % m2; return ((n * (a * 2 + b) % m2) / 2) % m; } template <typename T> T modgeometricsum(T a, T r, T n, T m){ a %= m; if(r == 1){ n %= m; return a * n % m; } return a * (modpow(r, n, m) + m - 1) % m * modinv(r - 1, m) % m; } template <typename T> T modgeometricsum2(T a, T r, T n, T m){ a %= m; if(r == 1){ n %= m; return a * n % m; } T ret = 0; T x = 1 % m; T sum = 0; for(int i = 0; n > 0; ++i){ if(n & 1){ (ret += x * modpow(r, sum, m) % m) %= m; sum |= 1LL << i; } (x += x * modpow(r, 1LL << i, m) % m) %= m; n >>= 1; } return a * ret % m; } } template <long long Modulus> struct ModInt{ long long val; constexpr ModInt(const long long _val = 0) noexcept : val(_val) { normalize(); } void normalize(){ val = (val % Modulus + Modulus) % Modulus; } inline ModInt &operator+=(const ModInt &rhs) noexcept { if(val += rhs.val, val >= Modulus) val -= Modulus; return *this; } inline ModInt &operator-=(const ModInt &rhs) noexcept { if(val -= rhs.val, val < 0) val += Modulus; return *this; } inline ModInt &operator*=(const ModInt &rhs) noexcept { val = val * rhs.val % Modulus; return *this; } inline ModInt &operator/=(const ModInt &rhs) noexcept { val = val * inv(rhs.val).val % Modulus; return *this; } inline ModInt &operator++() noexcept { if(++val >= Modulus) val -= Modulus; return *this; } inline ModInt operator++(int) noexcept { ModInt t = val; if(++val >= Modulus) val -= Modulus; return t; } inline ModInt &operator--() noexcept { if(--val < 0) val += Modulus; return *this; } inline ModInt operator--(int) noexcept { ModInt t = val; if(--val < 0) val += Modulus; return t; } inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; } inline ModInt inv(void) const { return inv(val); } ModInt pow(long long n){ assert(0 <= n); ModInt x = *this, r = 1; while(n){ if(n & 1) r *= x; x *= x; n >>= 1; } return r; } ModInt inv(const long long n) const { long long a = n, b = Modulus, u = 1, v = 0; while(b){ long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= Modulus; if(u < 0) u += Modulus; return u; } friend inline ModInt operator+(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) += rhs; } friend inline ModInt operator-(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) -= rhs; } friend inline ModInt operator*(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) *= rhs; } friend inline ModInt operator/(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) /= rhs; } friend inline bool operator==(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val == rhs.val; } friend inline bool operator!=(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val != rhs.val; } friend inline istream &operator>>(istream &is, ModInt &x) noexcept { is >> x.val; x.normalize(); return is; } friend inline ostream &operator<<(ostream &os, const ModInt &x) noexcept { return os << x.val; } }; using mint = ModInt<MOD>; ll T; void input(){ in(T); } void solve(){ ll n, m; in(n, m); using T = tuple<ll, ll, ll>; vector<T> eq = enumerate_quotients(m); mint ans = 0; for(auto [lb, rb, qb] : eq){ ll l = lb, r = min(n + 1, rb); if(l >= r) continue; // out(l, r); ll q = m % l; ans += modcalc::modarithmeticsum(q, -qb, r - l, MOD); } ans += max(0LL, (n - m) % MOD) * (m % MOD); out(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); T = 1; // input(); while(T--) solve(); }