DMOJ · acmtryouts0b

ACM U of T Tryouts C0 B - Interleaving Leaves

This C++ solution uses string processing for DMOJ acmtryouts0b ACM U of T Tryouts C0 B - Interleaving Leaves. Read the reasoning, inspect the code, or try your own test case below.

acmtryouts0bStringsString processingC++20 lines
Solution114of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Interleaving Leaves input strings and reversed interleaving output match.

Strings

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

Interleaving_Leaves.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); 
        int t, n; cin >> t;
        while (t--) {
            cin >> n;
            vector<char> x(n), y(n);
            for (int i = n - 1; i >= 0; i--) cin >> x[i];
            for (int i = n - 1; i >= 0; i--) cin >> y[i];
            for (int i = 0; i < n; i++) {
                cout << y[i] << x[i];
            }
            cout << '\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.