DMOJ · coci12c6p3

Dobri

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

coci12c6p3Data structuresSimulationC++32 lines
Solution079of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Dobri asks how many elements equal a sum of three earlier elements, allowing reuse; the code maintains earlier pair sums to test that condition.

Data structures

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

3_Dobri.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); 
        int n; cin >> n;
        vector<int> v(n);
        unordered_map<int, int> f;
        for (int i = 0; i < n; i++) {
            cin >> v[i];
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= i; j++) {
                if (!f.count(v[i] + v[j])) f[v[i] + v[j]] = i;
            }
        }
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < i; j++) {
                int cur = v[i] - v[j];
                if (f.count(cur) && f[cur] < i) {
                    cnt++;
                    break;
                }
            }
        }
        cout << cnt << '\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.