## Mackenzie New Year's Challenge P1 - King Modulus

View as PDF

Points: 3 (partial)
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Atharva hates modulo (long story). Due to this hate, he learned everything possible about modulo and has been self-named King Modulus. He wants you to share his frustration of modulo by giving you a task. Given two integers and , find the value of . The answer for can be viewed as the remainder of a division, where is the dividend and is the divisor. The result of a modulo operation is always non-negative. Here is an example of how the modulo operation works:

For example, is:

#### Input Specification

A single line containing and separated by a single space.

#### Output Specification

One line containing the result of .

#### Sample Input 1

7 4

#### Sample Output 1

3

#### Sample Input 2

15 3

#### Sample Output 2

0