Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. Question by Ibrahim Mesecan.
Long Modulus
Shqip
When we study programming, normally, we can do arithmetic operations on the numbers which are less than 2 billion or 4 billion
(p.s. if you are using "long long" it can go until 20 digits :).
4 billion has 10 digits. Write a program that calculates the modulus (remainder) of a 200 digit number,
after it's divided by another integer.
For Example: When 2244444444444444444444443 is divided by 2 the remainder is 1.
Ex.2: 12345678 Modulus 123 is 45.
Input specification
The first line contains an integer number n (where 1 ≤ n ≤ 200), the length of the dividend, then the
dividend number (num) itself.
The secondline contains an integer divisor (d) where it's 1 ≤ d ≤ 2 billion.
Output specification
Show the remainder followed by an endline character.
Sample Input 1 b>
td>
Sample Input 2 b>
td>
| |
5 33333
987
td>
|
15 123456789012345
654321
td>
|
Sample Output 1 b> td>
Sample Output 2 b> td>
tr>
762
td>
|
16305
td>
| | |
Для отправки решений необходимо выполнить вход.
|