Codeforces · 2203A

Towers of Boxes

This C++ solution uses simulation for Codeforces 2203A Towers of Boxes. Read the reasoning, inspect the code, or try your own test case below.

2203AImplementation & simulationSimulationC++20 lines
Solution223of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Towers of Boxes matches the dimensions and the implementation's closed-form tower count.

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

A_Towers_of_Boxes.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    void solve() {
        int n, m, d; cin >> n >> m >> d;
        int stk = d / m + 1;
        //ceil of n / stk
        cout << (n + stk - 1) / stk << '\n';
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        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.