DMOJ · aaaa1p1

AAAA 1 P1 - Even-Odd Sort

This C++ solution uses simulation for DMOJ aaaa1p1 AAAA 1 P1 - Even-Odd Sort. Read the reasoning, inspect the code, or try your own test case below.

aaaa1p1Sorting & searchingSimulationC++17 lines
Solution085of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Even-Odd Sort conditions match the code's parity count and Todd output rule.

Sorting & searching

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

P_1_Even_Odd_Sort.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        int odd = 0;
        for (int i = 0; i < n; i++) {
            int x; cin >> x;
            if (x & 1) odd++;
        }
        if (n % 2 == 0 && odd > n / 2) cout << "Todd" << '\n';
        else cout << "Steven" << '\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.