Preparando MOJI

Johny Likes Numbers

0ms 262144K

Description:

Johny likes numbers n and k very much. Now Johny wants to find the smallest integer x greater than n, so it is divisible by the number k.

Input:

The only line contains two integers n and k (1 ≤ n, k ≤ 109).

Output:

Print the smallest integer x > n, so it is divisible by the number k.

Sample Input:

5 3

Sample Output:

6

Sample Input:

25 13

Sample Output:

26

Sample Input:

26 13

Sample Output:

39

Informação

Codeforces

Provedor Codeforces

Código CF678A

Tags

implementationmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:06:38

Relacionados

Nada ainda