Submission #11204141


Source Code Expand

Copy
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 998244353;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
bool dbg = false;

template <uint MD>
struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(_v % MD + MD); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(ull(v) * r.v % MD); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1)
                r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<MOD>;

int N, A[202020];
itn A_MAX;
Mint w[1010101];
int cnt[1010101];

void solve() {
    FOR(i, 1, A_MAX + 1)
    w[i] = Mint{1} / i;
    FOR(i, 1, A_MAX + 1) {
        for (int j = i * 2; j <= A_MAX; j += i) {
            w[j] -= w[i];
        }
    }
    Mint ans = 0;
    FOR(d, 1, A_MAX + 1) {
        Mint a = 0, b = 0;
        for (int i = d; i <= A_MAX; i += d) {
            a += i * cnt[i];
            b += i * i * cnt[i];
        }
        a *= a;
        ans += w[d] * (a - b);
    }
    ans /= 2;
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N;
    FOR(N) {
        cin >> A[i];
        chmax(A_MAX, A[i]);
        cnt[A[i]]++;
    }


    solve();
    return 0;
}

Submission Info

Submission Time
Task C - LCMs
User cuthbert
Language C++14 (GCC 5.4.1)
Score 700
Code Size 3637 Byte
Status AC
Exec Time 318 ms
Memory 13696 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 21
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 271 ms 6400 KB
01-02.txt AC 311 ms 13056 KB
01-03.txt AC 315 ms 13440 KB
01-04.txt AC 294 ms 11136 KB
01-05.txt AC 313 ms 13184 KB
01-06.txt AC 309 ms 12800 KB
01-07.txt AC 305 ms 12416 KB
01-08.txt AC 313 ms 13184 KB
01-09.txt AC 306 ms 12544 KB
01-10.txt AC 318 ms 13696 KB
01-11.txt AC 318 ms 13696 KB
01-12.txt AC 318 ms 13696 KB
01-13.txt AC 318 ms 13696 KB
01-14.txt AC 318 ms 13696 KB
01-15.txt AC 318 ms 13696 KB
01-16.txt AC 318 ms 13696 KB
01-17.txt AC 318 ms 13696 KB
01-18.txt AC 307 ms 7552 KB
sample-01.txt AC 3 ms 6400 KB
sample-02.txt AC 3 ms 6400 KB
sample-03.txt AC 256 ms 10496 KB