PROBLEM 19
Easy

Remaining Seats

Programming Basics · C++

</>
STATUS Not solved

TASK

Problem

#19

In “Remaining Seats”, input integer data and given n people and row size k, print how many people are in the last incomplete row (0 if none).

EXAMPLE

Example

Input
10 3
Output
1

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 “Remaining Seats”: 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 “Remaining Seats”, 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 << '\n';
    return 0;
}