DMOJ · nccc1j3s1

A Math Problem

This C++ solution uses mathematical reasoning for DMOJ nccc1j3s1 A Math Problem. Read the reasoning, inspect the code, or try your own test case below.

nccc1j3s1MathMathematical reasoningC++14 lines
Solution002of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Mathematical reasoning

A Math Problem matches inputs K, P, X and minimizing X*M + K*P/M over positive integer M with three-decimal output.

Math

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

a_math_problem.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    int main(){
        ios::sync_with_stdio(0); cin.tie(0);
        int k, p, x; cin >> k >> p >> x;
        double pre = x * 1 + (k * p) / 1;
        for(double i = 2; ; i++){
            double f = x * i + (k * p) / i;
            if(f > pre) break;
            pre = f;
        }
        cout << fixed << setprecision(3) << pre << '\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.