DMOJ · dmopc22c5p1

Triple Triplets

This C++ solution uses simulation for DMOJ dmopc22c5p1 Triple Triplets. Read the reasoning, inspect the code, or try your own test case below.

dmopc22c5p1Implementation & simulationSimulationC++17 lines
Solution228of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Triple Triplets matches the integer input and combinatorial maximization encoded by the solution.

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

P_1_Triple_Triplets.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int INF = 0x3f3f3f3f; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        ll ans = 0;
        for (int i = 1; 2 * i < n; i++) {
            ll one = n - 2 * i;
            if (one > 1) {
                ans = max(ans, one * (one - 1) / 2 * i);
            }
        }
        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.