DMOJ · ciw26p3

CIW '26 P3 - Gumball Machine

This C++ solution uses simulation for DMOJ ciw26p3 CIW '26 P3 - Gumball Machine. Read the reasoning, inspect the code, or try your own test case below.

ciw26p3Graphs & treesSimulationC++22 lines
Solution105of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Gumball Machine objective reduces to the closest factor pair, matching the divisor search.

Graphs & trees

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_3_Gumball_Machine.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;
        if (n == 0) {
            cout << 0 << '\n';
            return 0;
        }
        int ans = n + 10;
        for (int i = 1; i * i <= n; i++) {
            if (n % i == 0) {
                ans = min(ans, i + n / 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.