TASK

Problem

#84

In “Paint Cans”, given wall area and coverage per can, print cans needed.

EXAMPLE

Example

Input

100 4

Output

25

LIMITS

Constraints

All values are non-negative and at most 10^12; every capacity/divisor is positive.

📖

LEARN Theory for this problem

+

Translate the story into a small arithmetic formula. Use ceiling division `(a+b-1)/b` when a partially filled unit still counts.

Connection to “Paint Cans”: here, intermediate values are best kept in named variables so the formula stays readable and data types remain clear.

💡

NEED HELP? Hints

+

['Identify what each input value means before writing the formula.', 'After solving “Paint Cans”, verify the algorithm on your own small example and on an allowed boundary case. Print only the required result with no extra text.']

✓

ANSWER Solution

+

#include <iostream>
using namespace std;
int main() {
    long long area, coverage;
    cin >> area >> coverage;
    cout << (area + coverage - 1) / coverage << '\n';
    return 0;
}