DMOJ · dmopc20c4p1

DMOPC '20 Contest 4 P1 - Missing Numbers

This C++ solution uses simulation for DMOJ dmopc20c4p1 DMOPC '20 Contest 4 P1 - Missing Numbers. Read the reasoning, inspect the code, or try your own test case below.

dmopc20c4p1Implementation & simulationSimulationC++25 lines
Solution148of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Missing Numbers asks for erased unordered pairs from N and remaining sum S; the arithmetic count matches.

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

missing_numbers.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
    typedef long long ll;
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int t;
        cin >> t;
        while(t--){
            ll n;
            ll s;
            cin >> n >> s;
            ll sum = n * (n + 1) / 2;
            ll diff = sum - s;
            if(diff < 3 || diff >= 2 * n){
                cout << 0 << '\n';
                continue;
            }
            ll low = max(1LL, diff - n);
            ll high = (diff - 1) / 2;
            cout << high - low + 1 << '\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.