DMOJ · ampl2023practicep1

Amplitude Hackathon '23 Practice Problem 1 - Gigatron EPS Modulo 998244353

This C++ solution uses number theory for DMOJ ampl2023practicep1 Amplitude Hackathon '23 Practice Problem 1 - Gigatron EPS Modulo 998244353. Read the reasoning, inspect the code, or try your own test case below.

ampl2023practicep1MathNumber theoryC++19 lines
Solution099of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Number theory

Gigatron EPS Modulo 998244353 task asks for the modular sum implemented by the code.

Math

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

Problem_1_Gigatron_EPS_Modulo_998244353.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 2e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        ll ans = 0;
        const int mod = 998244353;
        for (int i = 0; i < n; i++) {
            ll x; cin >> x;
            ans += x;
            if (ans >= mod) ans -= mod;
        }
        cout << ans << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.