DMOJ · a2

Mirrored Pairs

This C++ solution uses string processing for DMOJ a2 Mirrored Pairs. Read the reasoning, inspect the code, or try your own test case below.

a2Implementation & simulationString processingC++23 lines
Solution147of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Mirrored Pairs recognizes bd/db and pq/qp until two spaces, with the same Ready and result lines.

Implementation & simulation

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

Mirrored_Pairs.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        string s;
        getline(cin, s);
        cout << "Ready" << '\n';
        while (1) {
            if (s == "  ") break;
            char c = tolower(s[0]), cc = tolower(s[1]);
            string k = ""; k += c; k += cc;
            if (k == "pq" || k == "qp" || k == "db" || k == "bd") {
                cout << "Mirrored pair" << '\n';
            } else {
                cout << "Ordinary pair" << '\n';
            }
            getline(cin, s);
        }
        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.