TASK

Problem

#17

In “Pages Needed”, input integer data and given items n and positive capacity k, print the number of pages needed.

EXAMPLE

Example

Input

10 3

Output

4

LIMITS

Constraints

0 ≤ values ≤ 10^12; every divisor/capacity is positive.

📖

LEARN Theory for this problem

+

For non-negative integers, `/` gives the integer quotient and `%` gives the remainder.

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

💡

NEED HELP? Hints

+

['Choose division and remainder operations that match the requested decomposition.', 'After solving “Pages Needed”, 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 n, k;
    cin >> n >> k;
    cout << (n + k - 1) / k << '\n';
    return 0;
}