DMOJ · wac1p1

Simply a Simple Simplex Problem

This C++ solution uses binary search for DMOJ wac1p1 Simply a Simple Simplex Problem. Read the reasoning, inspect the code, or try your own test case below.

wac1p1Sorting & searchingBinary searchC++28 lines
Solution190of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Binary search

Simply a Simple Simplex Problem asks for the smallest vertex count with at least M simple edges; the binary search matches exactly.

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

simply_a_simplex_problem.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    #define int long long
     
    int find(int e){
        int low = 0, high = 1e10; 
        while (low < high){
            int mid = low + (high - low) / 2;
            if (mid * (mid - 1) / 2 >= e) high = mid;
            else low = mid + 1;
        }
        return low;
    }
    signed main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int t;
        cin >> t;
        while (t--) {
            int m;
            cin >> m;
            cout << find(m) << '\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.