DMOJ · ampl2023practicep2

Amplitude Hackathon '23 Practice Problem 2 - Go Amplitude!

This C++ solution uses modulo-11 string indexing for DMOJ ampl2023practicep2 Amplitude Hackathon '23 Practice Problem 2 - Go Amplitude!. Read the reasoning, inspect the code, or try your own test case below.

ampl2023practicep2StringsModulo-11 string indexingC++17 lines
Solution100of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Modulo-11 string indexing

GOAMPLITUDE repeats every 11 characters. Read the very large decimal index one digit at a time modulo 11, then use that remainder to select the requested character without storing the full number.

StringsModular arithmetic
Time
O(d)
Space
O(1)

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_2_Go_Amplitude.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        string n; cin >> n;
        string s = "GOAMPLITUDE";
        int indx = 0;
        for (char c : n) {
            indx = (indx * 10 + (c - '0')) % 11;
        }
        cout << s[indx >= 1 ? indx - 1 : 10] << '\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.